./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b09214ba8bbbbd71aa3d66dba50977f3edce53135be39821a74d1a850689d4e
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:17:54,562 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:17:54,565 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:17:54,587 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:17:54,588 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:17:54,588 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:17:54,589 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:17:54,590 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:17:54,591 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:17:54,592 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:17:54,593 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:17:54,593 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:17:54,594 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:17:54,594 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:17:54,595 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:17:54,596 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:17:54,597 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:17:54,597 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:17:54,599 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:17:54,600 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:17:54,601 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:17:54,604 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:17:54,604 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:17:54,605 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:17:54,607 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:17:54,608 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:17:54,608 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:17:54,609 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:17:54,609 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:17:54,611 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:17:54,611 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:17:54,612 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:17:54,613 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:17:54,614 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:17:54,615 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:17:54,615 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:17:54,616 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:17:54,616 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:17:54,616 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:17:54,617 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:17:54,618 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:17:54,618 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:17:54,634 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:17:54,634 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:17:54,634 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:17:54,634 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:17:54,635 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:17:54,635 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:17:54,635 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:17:54,635 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:17:54,636 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:17:54,636 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:17:54,637 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:17:54,637 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:17:54,638 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:17:54,638 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:17:54,639 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:17:54,639 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:17:54,639 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:17:54,639 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:17:54,639 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b09214ba8bbbbd71aa3d66dba50977f3edce53135be39821a74d1a850689d4e
[2024-02-28 17:17:55,193 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:17:55,210 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:17:55,212 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:17:55,212 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:17:55,213 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:17:55,213 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-02-28 17:17:56,616 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:17:56,826 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:17:56,826 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-02-28 17:17:56,838 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ef0b733eb/8e818e7033b844799c8dab1c050bae67/FLAG4fdfaf805
[2024-02-28 17:17:56,849 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ef0b733eb/8e818e7033b844799c8dab1c050bae67
[2024-02-28 17:17:56,851 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:17:56,852 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:17:56,853 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:17:56,853 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:17:56,856 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:17:56,856 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:17:56" (1/1) ...
[2024-02-28 17:17:56,857 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d081d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:56, skipping insertion in model container
[2024-02-28 17:17:56,857 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:17:56" (1/1) ...
[2024-02-28 17:17:56,863 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:17:56,891 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:17:57,003 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:17:57,153 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:17:57,159 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:17:57,170 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:17:57,191 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:17:57,267 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:17:57,267 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57 WrapperNode
[2024-02-28 17:17:57,267 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:17:57,268 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:17:57,268 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:17:57,268 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:17:57,274 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,287 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,305 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2024-02-28 17:17:57,306 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:17:57,306 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:17:57,306 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:17:57,306 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:17:57,314 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,314 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,317 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,318 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,324 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,326 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,328 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,329 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,331 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:17:57,331 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:17:57,331 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:17:57,331 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:17:57,332 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (1/1) ...
[2024-02-28 17:17:57,339 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:17:57,348 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:17:57,360 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-02-28 17:17:57,369 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-02-28 17:17:57,391 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:17:57,391 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:17:57,391 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:17:57,392 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:17:57,392 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:17:57,392 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:17:57,393 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:17:57,532 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:17:57,534 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:17:57,714 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:17:57,720 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:17:57,720 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:17:57,722 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:17:57 BoogieIcfgContainer
[2024-02-28 17:17:57,722 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:17:57,724 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:17:57,724 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:17:57,729 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:17:57,729 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:17:56" (1/3) ...
[2024-02-28 17:17:57,730 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e76cc0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:17:57, skipping insertion in model container
[2024-02-28 17:17:57,730 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:17:57" (2/3) ...
[2024-02-28 17:17:57,730 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e76cc0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:17:57, skipping insertion in model container
[2024-02-28 17:17:57,730 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:17:57" (3/3) ...
[2024-02-28 17:17:57,731 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2024-02-28 17:17:57,738 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:17:57,747 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:17:57,747 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-02-28 17:17:57,747 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:17:57,795 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:17:57,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,919 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-02-28 17:17:57,919 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:17:57,924 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-02-28 17:17:57,924 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,928 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,931 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:17:57,939 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,940 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-02-28 17:17:57,975 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-02-28 17:17:57,975 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:17:57,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-02-28 17:17:57,977 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2024-02-28 17:17:59,867 INFO  L134        LiptonReduction]: Checked pairs total: 11903
[2024-02-28 17:17:59,867 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-02-28 17:17:59,890 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:17:59,898 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4022697f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:17:59,898 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-02-28 17:17:59,900 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-02-28 17:17:59,901 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:17:59,901 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:17:59,902 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:17:59,902 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:17:59,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:17:59,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2024-02-28 17:17:59,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:17:59,914 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568192479]
[2024-02-28 17:17:59,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:17:59,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:00,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:00,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:00,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:00,028 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568192479]
[2024-02-28 17:18:00,029 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568192479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:00,029 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:00,029 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:18:00,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801103722]
[2024-02-28 17:18:00,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:00,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:18:00,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:00,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:18:00,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:18:00,062 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2024-02-28 17:18:00,064 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,064 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:00,065 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2024-02-28 17:18:00,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:00,126 INFO  L130       PetriNetUnfolder]: 29/222 cut-off events.
[2024-02-28 17:18:00,126 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2024-02-28 17:18:00,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 222 events. 29/222 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1154 event pairs, 28 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 249. Up to 78 conditions per place. 
[2024-02-28 17:18:00,128 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 15 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2024-02-28 17:18:00,128 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 136 flow
[2024-02-28 17:18:00,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:18:00,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:18:00,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions.
[2024-02-28 17:18:00,140 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6134020618556701
[2024-02-28 17:18:00,141 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 238 transitions.
[2024-02-28 17:18:00,141 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions.
[2024-02-28 17:18:00,142 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:00,144 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions.
[2024-02-28 17:18:00,146 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,150 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,150 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,152 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 238 transitions.
[2024-02-28 17:18:00,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 136 flow
[2024-02-28 17:18:00,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:00,156 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2024-02-28 17:18:00,157 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2024-02-28 17:18:00,159 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2024-02-28 17:18:00,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2024-02-28 17:18:00,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,160 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:00,160 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:00,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:18:00,160 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:18:00,161 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:00,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667475177, now seen corresponding path program 1 times
[2024-02-28 17:18:00,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:00,161 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954927717]
[2024-02-28 17:18:00,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:00,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:00,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:00,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:00,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:00,477 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954927717]
[2024-02-28 17:18:00,477 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954927717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:00,477 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:00,477 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:00,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767308269]
[2024-02-28 17:18:00,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:00,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:00,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:00,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:00,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:00,658 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2024-02-28 17:18:00,658 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,659 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:00,659 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2024-02-28 17:18:00,659 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:00,848 INFO  L130       PetriNetUnfolder]: 212/632 cut-off events.
[2024-02-28 17:18:00,848 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2024-02-28 17:18:00,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 632 events. 212/632 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3642 event pairs, 63 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 1154. Up to 276 conditions per place. 
[2024-02-28 17:18:00,856 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 57 selfloop transitions, 29 changer transitions 0/100 dead transitions.
[2024-02-28 17:18:00,857 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 383 flow
[2024-02-28 17:18:00,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:00,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:00,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions.
[2024-02-28 17:18:00,863 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5197594501718213
[2024-02-28 17:18:00,863 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 605 transitions.
[2024-02-28 17:18:00,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions.
[2024-02-28 17:18:00,866 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:00,866 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions.
[2024-02-28 17:18:00,868 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,874 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,874 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 605 transitions.
[2024-02-28 17:18:00,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 383 flow
[2024-02-28 17:18:00,876 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:00,877 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2024-02-28 17:18:00,877 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2024-02-28 17:18:00,878 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2024-02-28 17:18:00,878 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2024-02-28 17:18:00,878 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,878 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:00,878 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:00,879 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:18:00,879 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:18:00,879 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:00,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -946268794, now seen corresponding path program 1 times
[2024-02-28 17:18:00,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:00,880 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107616366]
[2024-02-28 17:18:00,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:00,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:00,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:00,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:00,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:00,917 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107616366]
[2024-02-28 17:18:00,918 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107616366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:00,918 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:00,918 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:18:00,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021882441]
[2024-02-28 17:18:00,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:00,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:18:00,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:00,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:18:00,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:18:00,933 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2024-02-28 17:18:00,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:00,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:00,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2024-02-28 17:18:00,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:01,024 INFO  L130       PetriNetUnfolder]: 128/491 cut-off events.
[2024-02-28 17:18:01,025 INFO  L131       PetriNetUnfolder]: For 115/126 co-relation queries the response was YES.
[2024-02-28 17:18:01,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 491 events. 128/491 cut-off events. For 115/126 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2713 event pairs, 10 based on Foata normal form. 14/475 useless extension candidates. Maximal degree in co-relation 1102. Up to 142 conditions per place. 
[2024-02-28 17:18:01,028 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 26 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2024-02-28 17:18:01,028 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 396 flow
[2024-02-28 17:18:01,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:18:01,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:18:01,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions.
[2024-02-28 17:18:01,030 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5824742268041238
[2024-02-28 17:18:01,030 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 339 transitions.
[2024-02-28 17:18:01,030 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions.
[2024-02-28 17:18:01,030 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:01,030 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions.
[2024-02-28 17:18:01,031 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,032 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,032 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,032 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 339 transitions.
[2024-02-28 17:18:01,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 396 flow
[2024-02-28 17:18:01,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:01,041 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2024-02-28 17:18:01,041 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2024-02-28 17:18:01,042 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-02-28 17:18:01,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2024-02-28 17:18:01,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,042 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:01,043 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:01,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:18:01,046 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:18:01,047 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:01,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 1190871734, now seen corresponding path program 1 times
[2024-02-28 17:18:01,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:01,047 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461929594]
[2024-02-28 17:18:01,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:01,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:01,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:01,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:01,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:01,251 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461929594]
[2024-02-28 17:18:01,251 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461929594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:01,251 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:01,251 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:01,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544060745]
[2024-02-28 17:18:01,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:01,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:01,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:01,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:01,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:01,469 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2024-02-28 17:18:01,469 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,469 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:01,470 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2024-02-28 17:18:01,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:01,600 INFO  L130       PetriNetUnfolder]: 209/640 cut-off events.
[2024-02-28 17:18:01,600 INFO  L131       PetriNetUnfolder]: For 285/289 co-relation queries the response was YES.
[2024-02-28 17:18:01,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 640 events. 209/640 cut-off events. For 285/289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3496 event pairs, 45 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 1636. Up to 328 conditions per place. 
[2024-02-28 17:18:01,604 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 45 selfloop transitions, 33 changer transitions 8/124 dead transitions.
[2024-02-28 17:18:01,604 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 703 flow
[2024-02-28 17:18:01,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:01,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:01,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2024-02-28 17:18:01,608 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5455326460481099
[2024-02-28 17:18:01,608 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2024-02-28 17:18:01,608 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2024-02-28 17:18:01,609 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:01,609 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2024-02-28 17:18:01,610 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,612 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,612 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,612 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2024-02-28 17:18:01,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 703 flow
[2024-02-28 17:18:01,614 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:01,616 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2024-02-28 17:18:01,616 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2024-02-28 17:18:01,616 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-02-28 17:18:01,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2024-02-28 17:18:01,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,617 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:01,617 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:01,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:18:01,617 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:18:01,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:01,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -277895401, now seen corresponding path program 1 times
[2024-02-28 17:18:01,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:01,618 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526227347]
[2024-02-28 17:18:01,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:01,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:01,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:01,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:01,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:01,846 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526227347]
[2024-02-28 17:18:01,846 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526227347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:01,846 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:01,846 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:01,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547905398]
[2024-02-28 17:18:01,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:01,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:01,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:01,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:01,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:01,962 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2024-02-28 17:18:01,963 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:01,963 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:01,963 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2024-02-28 17:18:01,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:02,271 INFO  L130       PetriNetUnfolder]: 361/945 cut-off events.
[2024-02-28 17:18:02,271 INFO  L131       PetriNetUnfolder]: For 732/740 co-relation queries the response was YES.
[2024-02-28 17:18:02,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 945 events. 361/945 cut-off events. For 732/740 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5703 event pairs, 74 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 3070. Up to 656 conditions per place. 
[2024-02-28 17:18:02,275 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 103 selfloop transitions, 76 changer transitions 20/214 dead transitions.
[2024-02-28 17:18:02,276 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 214 transitions, 1493 flow
[2024-02-28 17:18:02,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:02,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:02,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions.
[2024-02-28 17:18:02,278 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5395189003436426
[2024-02-28 17:18:02,278 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 628 transitions.
[2024-02-28 17:18:02,278 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 628 transitions.
[2024-02-28 17:18:02,279 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:02,279 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 628 transitions.
[2024-02-28 17:18:02,280 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:02,281 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:02,282 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:02,282 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 628 transitions.
[2024-02-28 17:18:02,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 214 transitions, 1493 flow
[2024-02-28 17:18:02,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 214 transitions, 1493 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:02,289 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:18:02,289 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2024-02-28 17:18:02,290 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2024-02-28 17:18:02,290 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:18:02,290 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:02,290 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:02,290 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:18:02,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 17:18:02,290 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:18:02,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:02,291 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529204463, now seen corresponding path program 1 times
[2024-02-28 17:18:02,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:02,291 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686104708]
[2024-02-28 17:18:02,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:02,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:02,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:18:02,315 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:18:02,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:18:02,342 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:18:02,342 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:18:02,343 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-02-28 17:18:02,344 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-02-28 17:18:02,344 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-02-28 17:18:02,345 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-02-28 17:18:02,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 17:18:02,346 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:02,348 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:18:02,348 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 17:18:02,365 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 17:18:02,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,391 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-02-28 17:18:02,391 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:18:02,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-02-28 17:18:02,391 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,393 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,393 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:18:02,393 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,393 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-02-28 17:18:02,413 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-02-28 17:18:02,414 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:18:02,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-02-28 17:18:02,417 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2024-02-28 17:18:04,867 INFO  L134        LiptonReduction]: Checked pairs total: 29998
[2024-02-28 17:18:04,868 INFO  L136        LiptonReduction]: Total number of compositions: 86
[2024-02-28 17:18:04,869 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:18:04,870 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4022697f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:18:04,870 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-02-28 17:18:04,871 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-02-28 17:18:04,871 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:18:04,871 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:04,871 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:18:04,871 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:04,871 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:04,871 INFO  L85        PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times
[2024-02-28 17:18:04,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:04,871 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961993433]
[2024-02-28 17:18:04,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:04,872 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:04,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:04,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:04,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:04,875 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961993433]
[2024-02-28 17:18:04,875 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961993433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:04,875 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:04,875 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:18:04,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688471320]
[2024-02-28 17:18:04,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:04,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:18:04,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:04,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:18:04,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:18:04,877 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 223
[2024-02-28 17:18:04,877 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:04,877 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:04,877 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 223
[2024-02-28 17:18:04,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:04,972 INFO  L130       PetriNetUnfolder]: 363/1129 cut-off events.
[2024-02-28 17:18:04,972 INFO  L131       PetriNetUnfolder]: For 94/181 co-relation queries the response was YES.
[2024-02-28 17:18:04,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1129 events. 363/1129 cut-off events. For 94/181 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7294 event pairs, 356 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1476. Up to 647 conditions per place. 
[2024-02-28 17:18:04,976 INFO  L137   encePairwiseOnDemand]: 222/223 looper letters, 21 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2024-02-28 17:18:04,976 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 186 flow
[2024-02-28 17:18:04,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:18:04,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:18:04,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions.
[2024-02-28 17:18:04,978 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6322869955156951
[2024-02-28 17:18:04,978 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 282 transitions.
[2024-02-28 17:18:04,978 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions.
[2024-02-28 17:18:04,978 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:04,978 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions.
[2024-02-28 17:18:04,979 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:04,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:04,980 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:04,980 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 282 transitions.
[2024-02-28 17:18:04,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 186 flow
[2024-02-28 17:18:04,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:04,981 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2024-02-28 17:18:04,981 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-02-28 17:18:04,982 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-02-28 17:18:04,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2024-02-28 17:18:04,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:04,982 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:04,982 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:04,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 17:18:04,982 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:04,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:04,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1479847002, now seen corresponding path program 1 times
[2024-02-28 17:18:04,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:04,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700049128]
[2024-02-28 17:18:04,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:04,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:04,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:05,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:05,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:05,123 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700049128]
[2024-02-28 17:18:05,124 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700049128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:05,124 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:05,124 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:05,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719004151]
[2024-02-28 17:18:05,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:05,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:05,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:05,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:05,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:05,289 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 223
[2024-02-28 17:18:05,290 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:05,290 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:05,290 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 223
[2024-02-28 17:18:05,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:06,168 INFO  L130       PetriNetUnfolder]: 5489/10606 cut-off events.
[2024-02-28 17:18:06,169 INFO  L131       PetriNetUnfolder]: For 254/289 co-relation queries the response was YES.
[2024-02-28 17:18:06,176 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19874 conditions, 10606 events. 5489/10606 cut-off events. For 254/289 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80178 event pairs, 1459 based on Foata normal form. 16/9949 useless extension candidates. Maximal degree in co-relation 19869. Up to 5638 conditions per place. 
[2024-02-28 17:18:06,205 INFO  L137   encePairwiseOnDemand]: 196/223 looper letters, 91 selfloop transitions, 48 changer transitions 0/157 dead transitions.
[2024-02-28 17:18:06,205 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 157 transitions, 621 flow
[2024-02-28 17:18:06,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:06,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:06,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions.
[2024-02-28 17:18:06,208 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5590433482810164
[2024-02-28 17:18:06,208 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 748 transitions.
[2024-02-28 17:18:06,208 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions.
[2024-02-28 17:18:06,208 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:06,208 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions.
[2024-02-28 17:18:06,210 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,211 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,211 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,211 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 748 transitions.
[2024-02-28 17:18:06,212 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 157 transitions, 621 flow
[2024-02-28 17:18:06,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:06,214 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2024-02-28 17:18:06,214 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-02-28 17:18:06,215 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:18:06,215 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2024-02-28 17:18:06,215 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,215 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:06,215 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:06,215 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 17:18:06,215 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:06,215 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:06,215 INFO  L85        PathProgramCache]: Analyzing trace with hash -576895935, now seen corresponding path program 1 times
[2024-02-28 17:18:06,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:06,216 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313581755]
[2024-02-28 17:18:06,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:06,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:06,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:06,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:06,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:06,234 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313581755]
[2024-02-28 17:18:06,234 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313581755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:06,234 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:06,234 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:18:06,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212239245]
[2024-02-28 17:18:06,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:06,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:18:06,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:06,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:18:06,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:18:06,248 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2024-02-28 17:18:06,249 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,249 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:06,249 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2024-02-28 17:18:06,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:06,683 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_73| v_~datas~0.base_75)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65 1))) (= (select .cse0 (+ .cse1 2 v_~datas~0.offset_65)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_65))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_65)))))  InVars {#race=|v_#race_73|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_65}  OutVars{#race=|v_#race_73|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_75, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_65}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [51#threadEXITtrue, 140#true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 102#L1017-4true, threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 17:18:06,683 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,684 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] L1017-4-->L1017-6: Formula: (= (store |v_#race_66| v_~datas~0.base_65 (store (select |v_#race_66| v_~datas~0.base_65) (+ (* v_threadThread2of2ForFork0_~i~0_33 4) v_~datas~0.offset_57) |v_threadThread2of2ForFork0_#t~nondet4_23|)) |v_#race_65|)  InVars {#race=|v_#race_66|, ~datas~0.base=v_~datas~0.base_65, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  OutVars{#race=|v_#race_65|, ~datas~0.base=v_~datas~0.base_65, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_23|, ~datas~0.offset=v_~datas~0.offset_57, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_33}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 20#L1017-9true, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 28#L1017-6true, 157#(= |#race~datas~0| 0), 3#ULTIMATE.startEXITtrue, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-02-28 17:18:06,684 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:18:06,797 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2024-02-28 17:18:06,797 INFO  L131       PetriNetUnfolder]: For 2006/2564 co-relation queries the response was YES.
[2024-02-28 17:18:06,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2006/2564 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53340 event pairs, 950 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2024-02-28 17:18:06,822 INFO  L137   encePairwiseOnDemand]: 217/223 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-02-28 17:18:06,822 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2024-02-28 17:18:06,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:18:06,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:18:06,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2024-02-28 17:18:06,824 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5919282511210763
[2024-02-28 17:18:06,824 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2024-02-28 17:18:06,824 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2024-02-28 17:18:06,824 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:06,824 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2024-02-28 17:18:06,825 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,826 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,826 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,826 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2024-02-28 17:18:06,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2024-02-28 17:18:06,835 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:06,836 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2024-02-28 17:18:06,836 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-02-28 17:18:06,837 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:18:06,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2024-02-28 17:18:06,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:06,837 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:06,837 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:06,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 17:18:06,837 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:06,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:06,837 INFO  L85        PathProgramCache]: Analyzing trace with hash 594333784, now seen corresponding path program 1 times
[2024-02-28 17:18:06,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:06,838 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80026463]
[2024-02-28 17:18:06,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:06,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:06,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:06,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:06,987 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:06,988 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80026463]
[2024-02-28 17:18:06,988 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80026463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:06,988 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:06,988 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:06,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187360850]
[2024-02-28 17:18:06,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:06,988 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:06,988 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:06,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:06,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:07,238 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 223
[2024-02-28 17:18:07,239 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:07,239 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:07,239 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 223
[2024-02-28 17:18:07,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:08,277 INFO  L130       PetriNetUnfolder]: 5567/10624 cut-off events.
[2024-02-28 17:18:08,277 INFO  L131       PetriNetUnfolder]: For 6462/6560 co-relation queries the response was YES.
[2024-02-28 17:18:08,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28208 conditions, 10624 events. 5567/10624 cut-off events. For 6462/6560 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 79146 event pairs, 1759 based on Foata normal form. 0/10089 useless extension candidates. Maximal degree in co-relation 28197. Up to 6791 conditions per place. 
[2024-02-28 17:18:08,323 INFO  L137   encePairwiseOnDemand]: 208/223 looper letters, 108 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2024-02-28 17:18:08,324 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1309 flow
[2024-02-28 17:18:08,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:08,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:08,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions.
[2024-02-28 17:18:08,326 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5747384155455905
[2024-02-28 17:18:08,326 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 769 transitions.
[2024-02-28 17:18:08,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions.
[2024-02-28 17:18:08,327 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:08,327 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions.
[2024-02-28 17:18:08,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,330 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,330 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,330 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 769 transitions.
[2024-02-28 17:18:08,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1309 flow
[2024-02-28 17:18:08,338 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1309 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:08,340 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:18:08,340 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2024-02-28 17:18:08,341 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2024-02-28 17:18:08,341 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:18:08,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,341 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:08,341 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:08,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 17:18:08,341 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:08,342 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:08,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171520631, now seen corresponding path program 1 times
[2024-02-28 17:18:08,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:08,342 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468673636]
[2024-02-28 17:18:08,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:08,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:08,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:08,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:08,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:08,535 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468673636]
[2024-02-28 17:18:08,535 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468673636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:08,535 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:08,535 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:08,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844312992]
[2024-02-28 17:18:08,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:08,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:08,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:08,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:08,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:08,681 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2024-02-28 17:18:08,682 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:08,682 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:08,682 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2024-02-28 17:18:08,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:10,758 INFO  L130       PetriNetUnfolder]: 11107/19827 cut-off events.
[2024-02-28 17:18:10,758 INFO  L131       PetriNetUnfolder]: For 18082/18251 co-relation queries the response was YES.
[2024-02-28 17:18:10,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62978 conditions, 19827 events. 11107/19827 cut-off events. For 18082/18251 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 151288 event pairs, 3140 based on Foata normal form. 8/18548 useless extension candidates. Maximal degree in co-relation 62962. Up to 13610 conditions per place. 
[2024-02-28 17:18:10,867 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 233 selfloop transitions, 132 changer transitions 0/385 dead transitions.
[2024-02-28 17:18:10,867 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 385 transitions, 2911 flow
[2024-02-28 17:18:10,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:10,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:10,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2024-02-28 17:18:10,871 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2024-02-28 17:18:10,871 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2024-02-28 17:18:10,871 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2024-02-28 17:18:10,871 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:10,871 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2024-02-28 17:18:10,873 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:10,876 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:10,876 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:10,876 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 779 transitions.
[2024-02-28 17:18:10,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 385 transitions, 2911 flow
[2024-02-28 17:18:10,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 385 transitions, 2911 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:10,911 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:18:10,912 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2024-02-28 17:18:10,913 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2024-02-28 17:18:10,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:18:10,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:10,914 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:10,914 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:10,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 17:18:10,914 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:10,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:10,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -485975421, now seen corresponding path program 1 times
[2024-02-28 17:18:10,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:10,915 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482732066]
[2024-02-28 17:18:10,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:10,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:10,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:11,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:18:11,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:11,207 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482732066]
[2024-02-28 17:18:11,208 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482732066] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:18:11,208 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412960936]
[2024-02-28 17:18:11,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:11,208 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:11,208 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:18:11,211 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:18:11,212 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 17:18:11,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:11,303 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-02-28 17:18:11,306 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:18:11,419 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:18:11,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,443 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 17:18:11,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,479 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:18:11,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,523 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,524 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:18:11,575 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:18:11,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:18:11,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:18:11,602 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:18:11,630 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-02-28 17:18:11,652 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-02-28 17:18:11,676 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-02-28 17:18:11,782 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:11,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-02-28 17:18:11,798 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:11,798 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-02-28 17:18:11,803 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-02-28 17:18:11,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-02-28 17:18:11,839 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [412960936] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:18:11,840 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:18:11,840 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-02-28 17:18:11,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354577327]
[2024-02-28 17:18:11,840 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:18:11,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-02-28 17:18:11,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:11,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-02-28 17:18:11,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=131, Unknown=10, NotChecked=84, Total=306
[2024-02-28 17:18:11,964 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 223
[2024-02-28 17:18:11,966 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:11,966 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:11,966 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 223
[2024-02-28 17:18:11,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:14,749 INFO  L130       PetriNetUnfolder]: 13643/23034 cut-off events.
[2024-02-28 17:18:14,750 INFO  L131       PetriNetUnfolder]: For 42400/42404 co-relation queries the response was YES.
[2024-02-28 17:18:14,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89032 conditions, 23034 events. 13643/23034 cut-off events. For 42400/42404 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 165617 event pairs, 5631 based on Foata normal form. 498/22055 useless extension candidates. Maximal degree in co-relation 89011. Up to 21318 conditions per place. 
[2024-02-28 17:18:14,873 INFO  L137   encePairwiseOnDemand]: 206/223 looper letters, 323 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2024-02-28 17:18:14,873 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3329 flow
[2024-02-28 17:18:14,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:18:14,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:18:14,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions.
[2024-02-28 17:18:14,876 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.41832158872517616
[2024-02-28 17:18:14,876 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 653 transitions.
[2024-02-28 17:18:14,876 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions.
[2024-02-28 17:18:14,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:14,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions.
[2024-02-28 17:18:14,878 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:14,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:14,880 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:14,880 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 653 transitions.
[2024-02-28 17:18:14,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3329 flow
[2024-02-28 17:18:15,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3233 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:15,229 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2024-02-28 17:18:15,229 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2024-02-28 17:18:15,230 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2024-02-28 17:18:15,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2024-02-28 17:18:15,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 83.27777777777777) internal successors, (1499), 18 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:15,230 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:15,230 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:15,245 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 17:18:15,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-02-28 17:18:15,431 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:15,433 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:15,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -834187754, now seen corresponding path program 1 times
[2024-02-28 17:18:15,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:15,434 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686258366]
[2024-02-28 17:18:15,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:15,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:15,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:15,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:18:15,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:15,679 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686258366]
[2024-02-28 17:18:15,679 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686258366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:15,679 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:15,679 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:18:15,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922965247]
[2024-02-28 17:18:15,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:15,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:18:15,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:15,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:18:15,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:18:15,925 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 223
[2024-02-28 17:18:15,926 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:15,926 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:15,926 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 223
[2024-02-28 17:18:15,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:19,266 INFO  L130       PetriNetUnfolder]: 13295/23434 cut-off events.
[2024-02-28 17:18:19,266 INFO  L131       PetriNetUnfolder]: For 42124/42205 co-relation queries the response was YES.
[2024-02-28 17:18:19,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 92527 conditions, 23434 events. 13295/23434 cut-off events. For 42124/42205 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 181808 event pairs, 3483 based on Foata normal form. 350/23302 useless extension candidates. Maximal degree in co-relation 92501. Up to 11062 conditions per place. 
[2024-02-28 17:18:19,389 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 448 selfloop transitions, 166 changer transitions 1/632 dead transitions.
[2024-02-28 17:18:19,390 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 632 transitions, 5697 flow
[2024-02-28 17:18:19,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-02-28 17:18:19,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-02-28 17:18:19,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions.
[2024-02-28 17:18:19,392 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.547085201793722
[2024-02-28 17:18:19,392 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 976 transitions.
[2024-02-28 17:18:19,393 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 976 transitions.
[2024-02-28 17:18:19,393 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:19,393 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 976 transitions.
[2024-02-28 17:18:19,395 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,396 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,397 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,397 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 976 transitions.
[2024-02-28 17:18:19,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 632 transitions, 5697 flow
[2024-02-28 17:18:19,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 632 transitions, 5613 flow, removed 31 selfloop flow, removed 2 redundant places.
[2024-02-28 17:18:19,674 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2024-02-28 17:18:19,674 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2024-02-28 17:18:19,675 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2024-02-28 17:18:19,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2024-02-28 17:18:19,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:19,675 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:19,676 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:19,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 17:18:19,676 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:19,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:19,676 INFO  L85        PathProgramCache]: Analyzing trace with hash 779781685, now seen corresponding path program 1 times
[2024-02-28 17:18:19,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:19,677 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366298059]
[2024-02-28 17:18:19,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:19,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:19,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:19,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-02-28 17:18:19,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:19,868 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366298059]
[2024-02-28 17:18:19,868 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366298059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:19,868 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:18:19,868 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:18:19,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799686348]
[2024-02-28 17:18:19,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:19,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:18:19,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:19,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:18:19,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:18:20,001 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 223
[2024-02-28 17:18:20,002 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:20,002 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:20,002 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 223
[2024-02-28 17:18:20,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:24,303 INFO  L130       PetriNetUnfolder]: 17483/30558 cut-off events.
[2024-02-28 17:18:24,304 INFO  L131       PetriNetUnfolder]: For 117297/117885 co-relation queries the response was YES.
[2024-02-28 17:18:24,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141844 conditions, 30558 events. 17483/30558 cut-off events. For 117297/117885 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 244225 event pairs, 3898 based on Foata normal form. 68/28478 useless extension candidates. Maximal degree in co-relation 141812. Up to 23106 conditions per place. 
[2024-02-28 17:18:24,524 INFO  L137   encePairwiseOnDemand]: 197/223 looper letters, 440 selfloop transitions, 164 changer transitions 1/622 dead transitions.
[2024-02-28 17:18:24,524 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 622 transitions, 6656 flow
[2024-02-28 17:18:24,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:18:24,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:18:24,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions.
[2024-02-28 17:18:24,526 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5822122571001495
[2024-02-28 17:18:24,527 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 779 transitions.
[2024-02-28 17:18:24,527 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions.
[2024-02-28 17:18:24,527 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:24,527 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions.
[2024-02-28 17:18:24,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:24,530 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:24,530 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 223.0) internal successors, (1561), 7 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:24,530 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 779 transitions.
[2024-02-28 17:18:24,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 622 transitions, 6656 flow
[2024-02-28 17:18:24,883 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 622 transitions, 6618 flow, removed 19 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:24,890 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2024-02-28 17:18:24,890 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2024-02-28 17:18:24,891 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2024-02-28 17:18:24,891 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2024-02-28 17:18:24,891 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:24,891 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:24,891 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:24,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 17:18:24,891 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:24,891 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:24,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664645135, now seen corresponding path program 1 times
[2024-02-28 17:18:24,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:24,892 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870946979]
[2024-02-28 17:18:24,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:24,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:24,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:25,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:25,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:25,214 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870946979]
[2024-02-28 17:18:25,214 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870946979] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:18:25,214 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145017245]
[2024-02-28 17:18:25,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:25,215 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:25,215 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:18:25,216 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:18:25,217 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 17:18:25,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:25,380 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-02-28 17:18:25,386 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:18:25,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118
[2024-02-28 17:18:25,523 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:18:25,523 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 17:18:25,550 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:18:25,570 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:18:25,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:18:25,601 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:25,602 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:18:25,620 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:25,621 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:18:25,653 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:18:25,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:18:25,665 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:18:25,665 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145017245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:25,665 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:18:25,665 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2024-02-28 17:18:25,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119179278]
[2024-02-28 17:18:25,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:25,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:18:25,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:25,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:18:25,666 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2024-02-28 17:18:25,956 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 223
[2024-02-28 17:18:25,957 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:25,957 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:25,957 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 223
[2024-02-28 17:18:25,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:33,117 INFO  L130       PetriNetUnfolder]: 25611/44258 cut-off events.
[2024-02-28 17:18:33,118 INFO  L131       PetriNetUnfolder]: For 222841/223413 co-relation queries the response was YES.
[2024-02-28 17:18:33,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 233478 conditions, 44258 events. 25611/44258 cut-off events. For 222841/223413 co-relation queries the response was YES. Maximal size of possible extension queue 1613. Compared 372009 event pairs, 3108 based on Foata normal form. 243/43813 useless extension candidates. Maximal degree in co-relation 233441. Up to 27629 conditions per place. 
[2024-02-28 17:18:33,465 INFO  L137   encePairwiseOnDemand]: 200/223 looper letters, 968 selfloop transitions, 231 changer transitions 3/1216 dead transitions.
[2024-02-28 17:18:33,466 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 1216 transitions, 14879 flow
[2024-02-28 17:18:33,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 17:18:33,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 17:18:33,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1171 transitions.
[2024-02-28 17:18:33,469 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4773746432939258
[2024-02-28 17:18:33,469 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1171 transitions.
[2024-02-28 17:18:33,469 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1171 transitions.
[2024-02-28 17:18:33,469 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:33,469 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1171 transitions.
[2024-02-28 17:18:33,471 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 106.45454545454545) internal successors, (1171), 11 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:33,473 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:33,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:33,474 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 11 states and 1171 transitions.
[2024-02-28 17:18:33,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 1216 transitions, 14879 flow
[2024-02-28 17:18:35,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 1216 transitions, 14563 flow, removed 158 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:35,978 INFO  L231             Difference]: Finished difference. Result has 142 places, 776 transitions, 9317 flow
[2024-02-28 17:18:35,978 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9317, PETRI_PLACES=142, PETRI_TRANSITIONS=776}
[2024-02-28 17:18:35,979 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 75 predicate places.
[2024-02-28 17:18:35,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 776 transitions, 9317 flow
[2024-02-28 17:18:35,979 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:35,979 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:35,979 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:35,984 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 17:18:36,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:36,184 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:36,185 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:36,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -1315530165, now seen corresponding path program 2 times
[2024-02-28 17:18:36,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:36,186 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910390528]
[2024-02-28 17:18:36,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:36,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:36,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:36,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:36,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:36,610 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910390528]
[2024-02-28 17:18:36,611 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910390528] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:18:36,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380413696]
[2024-02-28 17:18:36,611 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:18:36,611 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:36,611 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:18:36,612 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:18:36,616 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 17:18:36,758 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:18:36,758 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:18:36,760 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-02-28 17:18:36,765 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:18:36,774 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-02-28 17:18:36,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2024-02-28 17:18:36,865 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:18:36,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-02-28 17:18:36,898 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:18:36,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:18:36,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:18:37,007 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:37,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:18:37,055 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:37,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:18:37,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:18:37,134 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:18:37,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:18:37,144 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:18:37,144 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [380413696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:37,144 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:18:37,144 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2024-02-28 17:18:37,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667323082]
[2024-02-28 17:18:37,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:37,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 17:18:37,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:37,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 17:18:37,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306
[2024-02-28 17:18:37,584 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2024-02-28 17:18:37,585 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 776 transitions, 9317 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:37,585 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:37,585 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2024-02-28 17:18:37,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:18:47,452 INFO  L130       PetriNetUnfolder]: 29386/50627 cut-off events.
[2024-02-28 17:18:47,452 INFO  L131       PetriNetUnfolder]: For 353311/353968 co-relation queries the response was YES.
[2024-02-28 17:18:47,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292679 conditions, 50627 events. 29386/50627 cut-off events. For 353311/353968 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 431721 event pairs, 4048 based on Foata normal form. 477/50824 useless extension candidates. Maximal degree in co-relation 292632. Up to 18515 conditions per place. 
[2024-02-28 17:18:47,951 INFO  L137   encePairwiseOnDemand]: 207/223 looper letters, 1087 selfloop transitions, 522 changer transitions 35/1658 dead transitions.
[2024-02-28 17:18:47,951 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1658 transitions, 23195 flow
[2024-02-28 17:18:47,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 17:18:47,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 17:18:47,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1180 transitions.
[2024-02-28 17:18:47,954 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48104362005707296
[2024-02-28 17:18:47,954 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1180 transitions.
[2024-02-28 17:18:47,954 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1180 transitions.
[2024-02-28 17:18:47,954 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:18:47,954 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1180 transitions.
[2024-02-28 17:18:47,956 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.27272727272727) internal successors, (1180), 11 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:47,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:47,959 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 223.0) internal successors, (2676), 12 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:47,959 INFO  L175             Difference]: Start difference. First operand has 142 places, 776 transitions, 9317 flow. Second operand 11 states and 1180 transitions.
[2024-02-28 17:18:47,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1658 transitions, 23195 flow
[2024-02-28 17:18:50,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 1658 transitions, 23153 flow, removed 21 selfloop flow, removed 0 redundant places.
[2024-02-28 17:18:50,689 INFO  L231             Difference]: Finished difference. Result has 159 places, 1061 transitions, 15637 flow
[2024-02-28 17:18:50,689 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=9275, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15637, PETRI_PLACES=159, PETRI_TRANSITIONS=1061}
[2024-02-28 17:18:50,689 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 92 predicate places.
[2024-02-28 17:18:50,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 1061 transitions, 15637 flow
[2024-02-28 17:18:50,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:50,690 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:18:50,690 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:18:50,696 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 17:18:50,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-02-28 17:18:50,891 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:18:50,892 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:18:50,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -952832063, now seen corresponding path program 1 times
[2024-02-28 17:18:50,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:18:50,892 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255041612]
[2024-02-28 17:18:50,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:50,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:18:50,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:51,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:18:51,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:18:51,275 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255041612]
[2024-02-28 17:18:51,275 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255041612] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:18:51,275 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538032485]
[2024-02-28 17:18:51,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:18:51,276 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:18:51,276 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:18:51,276 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:18:51,284 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 17:18:51,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:18:51,361 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-02-28 17:18:51,364 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:18:51,374 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-02-28 17:18:51,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 56
[2024-02-28 17:18:51,467 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:18:51,467 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-02-28 17:18:51,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:18:51,516 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:18:51,525 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:18:51,543 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:51,544 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:18:51,561 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:18:51,561 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:18:51,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:18:51,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:18:51,584 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:18:51,584 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538032485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:18:51,584 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:18:51,584 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 11
[2024-02-28 17:18:51,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926387579]
[2024-02-28 17:18:51,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:18:51,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:18:51,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:18:51,585 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:18:51,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2024-02-28 17:18:52,229 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 223
[2024-02-28 17:18:52,230 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1061 transitions, 15637 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:18:52,231 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:18:52,231 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 223
[2024-02-28 17:18:52,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:19:02,229 INFO  L130       PetriNetUnfolder]: 25293/45566 cut-off events.
[2024-02-28 17:19:02,229 INFO  L131       PetriNetUnfolder]: For 466512/469194 co-relation queries the response was YES.
[2024-02-28 17:19:02,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290394 conditions, 45566 events. 25293/45566 cut-off events. For 466512/469194 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 407756 event pairs, 1755 based on Foata normal form. 1039/45816 useless extension candidates. Maximal degree in co-relation 290339. Up to 17989 conditions per place. 
[2024-02-28 17:19:02,870 INFO  L137   encePairwiseOnDemand]: 212/223 looper letters, 1629 selfloop transitions, 83 changer transitions 0/1876 dead transitions.
[2024-02-28 17:19:02,870 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1876 transitions, 31384 flow
[2024-02-28 17:19:02,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-02-28 17:19:02,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-02-28 17:19:02,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions.
[2024-02-28 17:19:02,872 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5366218236173393
[2024-02-28 17:19:02,873 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions.
[2024-02-28 17:19:02,873 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions.
[2024-02-28 17:19:02,873 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:19:02,873 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions.
[2024-02-28 17:19:02,875 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:02,877 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:02,877 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 223.0) internal successors, (2230), 10 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:02,877 INFO  L175             Difference]: Start difference. First operand has 159 places, 1061 transitions, 15637 flow. Second operand 9 states and 1077 transitions.
[2024-02-28 17:19:02,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1876 transitions, 31384 flow
[2024-02-28 17:19:06,556 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 1876 transitions, 31144 flow, removed 114 selfloop flow, removed 3 redundant places.
[2024-02-28 17:19:06,578 INFO  L231             Difference]: Finished difference. Result has 160 places, 1060 transitions, 15663 flow
[2024-02-28 17:19:06,579 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15497, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15663, PETRI_PLACES=160, PETRI_TRANSITIONS=1060}
[2024-02-28 17:19:06,580 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 93 predicate places.
[2024-02-28 17:19:06,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 1060 transitions, 15663 flow
[2024-02-28 17:19:06,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:06,580 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:19:06,580 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:19:06,591 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 17:19:06,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:06,782 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:19:06,782 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:19:06,782 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473696100, now seen corresponding path program 1 times
[2024-02-28 17:19:06,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:19:06,782 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837760976]
[2024-02-28 17:19:06,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:19:06,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:19:06,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:19:06,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:06,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:19:06,850 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837760976]
[2024-02-28 17:19:06,850 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837760976] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:19:06,850 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436843182]
[2024-02-28 17:19:06,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:19:06,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:06,850 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:19:06,851 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:19:06,854 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 17:19:06,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:19:06,990 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 17:19:06,991 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:19:07,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:07,031 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:19:07,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:07,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436843182] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:19:07,067 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:19:07,067 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-02-28 17:19:07,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999174830]
[2024-02-28 17:19:07,068 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:19:07,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-02-28 17:19:07,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:19:07,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-02-28 17:19:07,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-02-28 17:19:07,175 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 223
[2024-02-28 17:19:07,177 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 1060 transitions, 15663 flow. Second operand  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:07,177 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:19:07,177 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 223
[2024-02-28 17:19:07,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:19:13,028 INFO  L130       PetriNetUnfolder]: 15396/31719 cut-off events.
[2024-02-28 17:19:13,028 INFO  L131       PetriNetUnfolder]: For 305768/309415 co-relation queries the response was YES.
[2024-02-28 17:19:13,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193046 conditions, 31719 events. 15396/31719 cut-off events. For 305768/309415 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 305458 event pairs, 668 based on Foata normal form. 629/31810 useless extension candidates. Maximal degree in co-relation 192993. Up to 13355 conditions per place. 
[2024-02-28 17:19:13,396 INFO  L137   encePairwiseOnDemand]: 216/223 looper letters, 356 selfloop transitions, 7 changer transitions 31/1129 dead transitions.
[2024-02-28 17:19:13,396 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1129 transitions, 17228 flow
[2024-02-28 17:19:13,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-02-28 17:19:13,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-02-28 17:19:13,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions.
[2024-02-28 17:19:13,399 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5667040358744395
[2024-02-28 17:19:13,399 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions.
[2024-02-28 17:19:13,399 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions.
[2024-02-28 17:19:13,399 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:19:13,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions.
[2024-02-28 17:19:13,401 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:13,403 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:13,403 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 223.0) internal successors, (2007), 9 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:13,403 INFO  L175             Difference]: Start difference. First operand has 160 places, 1060 transitions, 15663 flow. Second operand 8 states and 1011 transitions.
[2024-02-28 17:19:13,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1129 transitions, 17228 flow
[2024-02-28 17:19:15,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1129 transitions, 17054 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-02-28 17:19:15,235 INFO  L231             Difference]: Finished difference. Result has 163 places, 1017 transitions, 15096 flow
[2024-02-28 17:19:15,236 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=15177, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15096, PETRI_PLACES=163, PETRI_TRANSITIONS=1017}
[2024-02-28 17:19:15,236 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 96 predicate places.
[2024-02-28 17:19:15,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 1017 transitions, 15096 flow
[2024-02-28 17:19:15,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:15,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:19:15,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:19:15,241 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-02-28 17:19:15,441 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 17:19:15,442 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:19:15,442 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:19:15,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -985146553, now seen corresponding path program 3 times
[2024-02-28 17:19:15,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:19:15,443 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17910822]
[2024-02-28 17:19:15,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:19:15,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:19:15,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:19:15,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:15,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:19:15,866 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17910822]
[2024-02-28 17:19:15,866 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17910822] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:19:15,866 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98352507]
[2024-02-28 17:19:15,866 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 17:19:15,866 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:15,866 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:19:15,867 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:19:15,869 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 17:19:16,017 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 17:19:16,017 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:19:16,018 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-02-28 17:19:16,023 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:19:16,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-02-28 17:19:16,135 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:19:16,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:19:16,176 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:19:16,189 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:19:16,226 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:19:16,265 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:16,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:19:16,324 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:19:16,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:19:16,387 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:16,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:19:16,433 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:16,449 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:16,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:16,517 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:16,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:16,527 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:19:16,527 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [98352507] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:19:16,527 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:19:16,527 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2024-02-28 17:19:16,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733425035]
[2024-02-28 17:19:16,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:19:16,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 17:19:16,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:19:16,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 17:19:16,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2024-02-28 17:19:17,087 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2024-02-28 17:19:17,088 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 1017 transitions, 15096 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:17,088 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:19:17,088 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2024-02-28 17:19:17,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:19:29,237 INFO  L130       PetriNetUnfolder]: 26004/45151 cut-off events.
[2024-02-28 17:19:29,237 INFO  L131       PetriNetUnfolder]: For 444696/445207 co-relation queries the response was YES.
[2024-02-28 17:19:29,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 289287 conditions, 45151 events. 26004/45151 cut-off events. For 444696/445207 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 376100 event pairs, 3055 based on Foata normal form. 404/45231 useless extension candidates. Maximal degree in co-relation 289230. Up to 23580 conditions per place. 
[2024-02-28 17:19:29,727 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1030 selfloop transitions, 602 changer transitions 38/1682 dead transitions.
[2024-02-28 17:19:29,727 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1682 transitions, 26046 flow
[2024-02-28 17:19:29,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 17:19:29,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 17:19:29,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1660 transitions.
[2024-02-28 17:19:29,731 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4962630792227205
[2024-02-28 17:19:29,731 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1660 transitions.
[2024-02-28 17:19:29,731 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1660 transitions.
[2024-02-28 17:19:29,731 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:19:29,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1660 transitions.
[2024-02-28 17:19:29,733 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 110.66666666666667) internal successors, (1660), 15 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:29,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:29,737 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 223.0) internal successors, (3568), 16 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:29,737 INFO  L175             Difference]: Start difference. First operand has 163 places, 1017 transitions, 15096 flow. Second operand 15 states and 1660 transitions.
[2024-02-28 17:19:29,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1682 transitions, 26046 flow
[2024-02-28 17:19:32,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1682 transitions, 25696 flow, removed 50 selfloop flow, removed 3 redundant places.
[2024-02-28 17:19:32,184 INFO  L231             Difference]: Finished difference. Result has 179 places, 1268 transitions, 20571 flow
[2024-02-28 17:19:32,185 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=14897, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20571, PETRI_PLACES=179, PETRI_TRANSITIONS=1268}
[2024-02-28 17:19:32,185 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 112 predicate places.
[2024-02-28 17:19:32,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1268 transitions, 20571 flow
[2024-02-28 17:19:32,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:32,186 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:19:32,186 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:19:32,191 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 17:19:32,386 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:32,387 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:19:32,387 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:19:32,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 541897883, now seen corresponding path program 4 times
[2024-02-28 17:19:32,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:19:32,388 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817199179]
[2024-02-28 17:19:32,389 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:19:32,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:19:32,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:19:32,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:32,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:19:32,837 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817199179]
[2024-02-28 17:19:32,837 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817199179] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:19:32,838 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675348617]
[2024-02-28 17:19:32,838 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 17:19:32,838 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:32,838 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:19:32,839 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:19:32,840 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 17:19:33,002 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 17:19:33,003 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:19:33,004 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-02-28 17:19:33,013 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:19:33,021 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-02-28 17:19:33,106 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:19:33,107 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-02-28 17:19:33,162 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:19:33,172 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:19:33,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:19:33,235 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:19:33,271 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:33,272 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:19:33,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:33,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:19:33,370 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:33,386 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:33,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:33,435 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:33,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:33,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:19:33,492 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:19:33,493 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675348617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:19:33,493 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:19:33,493 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2024-02-28 17:19:33,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979383306]
[2024-02-28 17:19:33,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:19:33,494 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 17:19:33,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:19:33,494 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 17:19:33,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2024-02-28 17:19:34,004 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2024-02-28 17:19:34,005 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1268 transitions, 20571 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:34,005 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:19:34,006 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2024-02-28 17:19:34,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:19:48,646 INFO  L130       PetriNetUnfolder]: 28505/49623 cut-off events.
[2024-02-28 17:19:48,646 INFO  L131       PetriNetUnfolder]: For 612494/613077 co-relation queries the response was YES.
[2024-02-28 17:19:48,976 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 345311 conditions, 49623 events. 28505/49623 cut-off events. For 612494/613077 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 419890 event pairs, 3217 based on Foata normal form. 356/49614 useless extension candidates. Maximal degree in co-relation 345249. Up to 23695 conditions per place. 
[2024-02-28 17:19:49,186 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1364 selfloop transitions, 532 changer transitions 35/1943 dead transitions.
[2024-02-28 17:19:49,186 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1943 transitions, 33856 flow
[2024-02-28 17:19:49,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-02-28 17:19:49,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-02-28 17:19:49,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions.
[2024-02-28 17:19:49,188 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48654708520179374
[2024-02-28 17:19:49,188 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions.
[2024-02-28 17:19:49,188 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions.
[2024-02-28 17:19:49,188 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:19:49,188 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions.
[2024-02-28 17:19:49,190 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:49,192 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:49,192 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 223.0) internal successors, (2899), 13 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:49,192 INFO  L175             Difference]: Start difference. First operand has 179 places, 1268 transitions, 20571 flow. Second operand 12 states and 1302 transitions.
[2024-02-28 17:19:49,192 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1943 transitions, 33856 flow
[2024-02-28 17:19:54,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1943 transitions, 33063 flow, removed 388 selfloop flow, removed 2 redundant places.
[2024-02-28 17:19:54,714 INFO  L231             Difference]: Finished difference. Result has 194 places, 1519 transitions, 26205 flow
[2024-02-28 17:19:54,715 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=19795, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=841, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26205, PETRI_PLACES=194, PETRI_TRANSITIONS=1519}
[2024-02-28 17:19:54,715 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 127 predicate places.
[2024-02-28 17:19:54,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 1519 transitions, 26205 flow
[2024-02-28 17:19:54,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:54,717 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:19:54,717 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:19:54,724 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 17:19:54,917 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:54,918 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:19:54,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:19:54,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331203745, now seen corresponding path program 5 times
[2024-02-28 17:19:54,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:19:54,919 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497774968]
[2024-02-28 17:19:54,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:19:54,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:19:54,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:19:55,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:19:55,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:19:55,344 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497774968]
[2024-02-28 17:19:55,344 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497774968] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:19:55,344 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186460618]
[2024-02-28 17:19:55,344 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 17:19:55,345 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:19:55,345 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:19:55,346 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:19:55,347 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 17:19:55,468 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:19:55,468 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:19:55,469 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-02-28 17:19:55,472 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:19:55,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,533 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-02-28 17:19:55,638 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:19:55,638 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-02-28 17:19:55,681 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,682 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-02-28 17:19:55,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:19:55,735 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:19:55,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 17:19:55,815 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:55,815 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 17:19:55,871 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:19:55,893 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,895 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:19:55,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:19:55,940 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:19:55,941 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-02-28 17:19:55,966 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:19:55,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 17:19:55,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-02-28 17:19:55,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:19:55,995 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:19:55,995 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [186460618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:19:55,995 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:19:55,995 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16
[2024-02-28 17:19:55,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582015872]
[2024-02-28 17:19:55,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:19:55,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 17:19:55,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:19:55,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 17:19:55,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306
[2024-02-28 17:19:56,668 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 223
[2024-02-28 17:19:56,669 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1519 transitions, 26205 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:19:56,669 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:19:56,669 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 223
[2024-02-28 17:19:56,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:14,223 INFO  L130       PetriNetUnfolder]: 29302/51201 cut-off events.
[2024-02-28 17:20:14,224 INFO  L131       PetriNetUnfolder]: For 792739/793363 co-relation queries the response was YES.
[2024-02-28 17:20:14,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 380440 conditions, 51201 events. 29302/51201 cut-off events. For 792739/793363 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 436333 event pairs, 3287 based on Foata normal form. 454/51290 useless extension candidates. Maximal degree in co-relation 380372. Up to 26464 conditions per place. 
[2024-02-28 17:20:14,891 INFO  L137   encePairwiseOnDemand]: 203/223 looper letters, 1356 selfloop transitions, 638 changer transitions 30/2036 dead transitions.
[2024-02-28 17:20:14,891 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 2036 transitions, 37326 flow
[2024-02-28 17:20:14,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-02-28 17:20:14,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-02-28 17:20:14,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1419 transitions.
[2024-02-28 17:20:14,893 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4894791307347361
[2024-02-28 17:20:14,893 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1419 transitions.
[2024-02-28 17:20:14,893 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1419 transitions.
[2024-02-28 17:20:14,893 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:20:14,894 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1419 transitions.
[2024-02-28 17:20:14,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 109.15384615384616) internal successors, (1419), 13 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:14,897 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:14,897 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:14,897 INFO  L175             Difference]: Start difference. First operand has 194 places, 1519 transitions, 26205 flow. Second operand 13 states and 1419 transitions.
[2024-02-28 17:20:14,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 2036 transitions, 37326 flow
[2024-02-28 17:20:23,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 2036 transitions, 36322 flow, removed 433 selfloop flow, removed 5 redundant places.
[2024-02-28 17:20:23,480 INFO  L231             Difference]: Finished difference. Result has 206 places, 1644 transitions, 29953 flow
[2024-02-28 17:20:23,481 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=25312, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29953, PETRI_PLACES=206, PETRI_TRANSITIONS=1644}
[2024-02-28 17:20:23,481 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 139 predicate places.
[2024-02-28 17:20:23,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 1644 transitions, 29953 flow
[2024-02-28 17:20:23,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:23,482 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:23,482 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:20:23,489 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-02-28 17:20:23,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-02-28 17:20:23,683 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:20:23,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:23,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -1301331673, now seen corresponding path program 1 times
[2024-02-28 17:20:23,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:23,684 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391943043]
[2024-02-28 17:20:23,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:23,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:23,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:20:23,705 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:20:23,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:20:23,719 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:20:23,719 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:20:23,719 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2024-02-28 17:20:23,719 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-02-28 17:20:23,720 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-02-28 17:20:23,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-02-28 17:20:23,720 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:23,721 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:20:23,721 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-02-28 17:20:23,734 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-02-28 17:20:23,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,768 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-02-28 17:20:23,768 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-02-28 17:20:23,768 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-02-28 17:20:23,769 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,770 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,770 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:20:23,770 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,770 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-02-28 17:20:23,802 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-02-28 17:20:23,802 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-02-28 17:20:23,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1531 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-02-28 17:20:23,811 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2024-02-28 17:20:25,932 INFO  L134        LiptonReduction]: Checked pairs total: 53700
[2024-02-28 17:20:25,933 INFO  L136        LiptonReduction]: Total number of compositions: 94
[2024-02-28 17:20:25,935 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:20:25,935 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4022697f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:20:25,935 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-02-28 17:20:25,936 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-02-28 17:20:25,936 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:20:25,936 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:25,936 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:20:25,936 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:25,937 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:25,937 INFO  L85        PathProgramCache]: Analyzing trace with hash 900, now seen corresponding path program 1 times
[2024-02-28 17:20:25,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:25,937 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812029268]
[2024-02-28 17:20:25,937 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:25,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:25,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:25,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:20:25,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:25,940 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812029268]
[2024-02-28 17:20:25,940 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812029268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:25,940 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:25,941 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:20:25,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774455066]
[2024-02-28 17:20:25,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:25,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:20:25,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:25,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:20:25,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:20:25,942 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 252
[2024-02-28 17:20:25,942 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:25,942 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:25,942 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 252
[2024-02-28 17:20:25,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:26,450 INFO  L130       PetriNetUnfolder]: 3248/7585 cut-off events.
[2024-02-28 17:20:26,450 INFO  L131       PetriNetUnfolder]: For 647/1494 co-relation queries the response was YES.
[2024-02-28 17:20:26,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12704 conditions, 7585 events. 3248/7585 cut-off events. For 647/1494 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 64204 event pairs, 3205 based on Foata normal form. 0/6863 useless extension candidates. Maximal degree in co-relation 10479. Up to 4887 conditions per place. 
[2024-02-28 17:20:26,477 INFO  L137   encePairwiseOnDemand]: 251/252 looper letters, 27 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2024-02-28 17:20:26,477 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 234 flow
[2024-02-28 17:20:26,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:20:26,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:20:26,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 326 transitions.
[2024-02-28 17:20:26,478 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6468253968253969
[2024-02-28 17:20:26,478 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 326 transitions.
[2024-02-28 17:20:26,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 326 transitions.
[2024-02-28 17:20:26,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:20:26,478 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 326 transitions.
[2024-02-28 17:20:26,479 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:26,479 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:26,479 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:26,479 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 326 transitions.
[2024-02-28 17:20:26,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 234 flow
[2024-02-28 17:20:26,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:20:26,481 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2024-02-28 17:20:26,481 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2024-02-28 17:20:26,481 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2024-02-28 17:20:26,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2024-02-28 17:20:26,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:26,481 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:26,481 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:26,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-02-28 17:20:26,482 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:26,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:26,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -164949161, now seen corresponding path program 1 times
[2024-02-28 17:20:26,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:26,482 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109021435]
[2024-02-28 17:20:26,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:26,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:26,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:26,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:20:26,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:26,562 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109021435]
[2024-02-28 17:20:26,563 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109021435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:26,563 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:26,563 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:20:26,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792575792]
[2024-02-28 17:20:26,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:26,563 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:20:26,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:26,563 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:20:26,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:20:26,712 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 252
[2024-02-28 17:20:26,713 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:26,713 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:26,713 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 252
[2024-02-28 17:20:26,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:34,500 INFO  L130       PetriNetUnfolder]: 72405/116612 cut-off events.
[2024-02-28 17:20:34,500 INFO  L131       PetriNetUnfolder]: For 3734/4224 co-relation queries the response was YES.
[2024-02-28 17:20:34,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222409 conditions, 116612 events. 72405/116612 cut-off events. For 3734/4224 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 983482 event pairs, 18294 based on Foata normal form. 157/112065 useless extension candidates. Maximal degree in co-relation 222403. Up to 69950 conditions per place. 
[2024-02-28 17:20:34,959 INFO  L137   encePairwiseOnDemand]: 221/252 looper letters, 109 selfloop transitions, 64 changer transitions 0/195 dead transitions.
[2024-02-28 17:20:34,959 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 195 transitions, 787 flow
[2024-02-28 17:20:34,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:20:34,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:20:34,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions.
[2024-02-28 17:20:34,961 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5767195767195767
[2024-02-28 17:20:34,961 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 872 transitions.
[2024-02-28 17:20:34,961 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 872 transitions.
[2024-02-28 17:20:34,961 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:20:34,961 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 872 transitions.
[2024-02-28 17:20:34,962 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:34,963 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:34,963 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:34,963 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 872 transitions.
[2024-02-28 17:20:34,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 195 transitions, 787 flow
[2024-02-28 17:20:34,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 195 transitions, 787 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:20:34,969 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2024-02-28 17:20:34,969 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2024-02-28 17:20:34,970 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2024-02-28 17:20:34,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2024-02-28 17:20:34,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:34,970 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:34,970 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:34,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-02-28 17:20:34,970 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:34,970 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:34,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831077822, now seen corresponding path program 1 times
[2024-02-28 17:20:34,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:34,971 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042790916]
[2024-02-28 17:20:34,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:34,971 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:34,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:34,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:20:34,987 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:34,987 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042790916]
[2024-02-28 17:20:34,987 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042790916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:34,987 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:34,987 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:20:34,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895876309]
[2024-02-28 17:20:34,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:34,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:20:34,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:34,988 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:20:34,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:20:35,004 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 252
[2024-02-28 17:20:35,005 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:35,005 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:35,005 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 252
[2024-02-28 17:20:35,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:35,653 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2024-02-28 17:20:35,653 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse])
[2024-02-28 17:20:35,654 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:35,654 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:20:38,163 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,163 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,163 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,164 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 139#L1017-1true, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,164 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,165 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 58#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,165 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-02-28 17:20:38,482 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,482 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,482 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,483 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,483 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,483 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,483 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,483 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,484 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 13#L1017-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,484 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,484 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,485 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 139#L1017-1true, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,485 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-02-28 17:20:38,770 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([850] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_172| v_~datas~0.base_131)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_39 4))) (and (= (select .cse0 (+ .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ 2 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_115)) |v_threadThread1of3ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_172|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_30|, ~datas~0.base=v_~datas~0.base_131, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_15|, #race=|v_#race_172|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_131, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_115, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_39}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,770 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,772 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([797] L1017-4-->L1017-6: Formula: (= |v_#race_150| (store |v_#race_151| v_~datas~0.base_107 (store (select |v_#race_151| v_~datas~0.base_107) (+ (* v_threadThread2of3ForFork0_~i~0_27 4) v_~datas~0.offset_93) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_151|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  OutVars{#race=|v_#race_150|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_107, ~datas~0.offset=v_~datas~0.offset_93, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_27}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 148#L1017-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 128#L1017-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,772 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,772 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,772 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 67#L1017-2true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:38,773 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:38,773 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-02-28 17:20:39,166 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L1017-4-->L1017-6: Formula: (= (store |v_#race_147| v_~datas~0.base_103 (store (select |v_#race_147| v_~datas~0.base_103) (+ v_~datas~0.offset_91 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_21|)) |v_#race_146|)  InVars {#race=|v_#race_147|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_146|, ~datas~0.base=v_~datas~0.base_103, ~datas~0.offset=v_~datas~0.offset_91, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_21|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 59#L1017-9true, 3#ULTIMATE.startEXITtrue, 43#L1017-4true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 64#L1017-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-02-28 17:20:39,166 INFO  L383   tUnfolder$Statistics]: this new event has 54 ancestors and is cut-off event
[2024-02-28 17:20:39,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-02-28 17:20:39,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-02-28 17:20:39,166 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-02-28 17:20:40,527 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 36#L1029-1true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-02-28 17:20:40,528 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([848] L1017-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_170| v_~datas~0.base_129)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_33 4))) (and (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 1 v_~datas~0.offset_113))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_113))) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= (select .cse0 (+ .cse1 v_~datas~0.offset_113)) |v_threadThread3of3ForFork0_#t~nondet4_28|)))  InVars {#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  OutVars{#race=|v_#race_170|, ~datas~0.base=v_~datas~0.base_129, ~datas~0.offset=v_~datas~0.offset_113, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 83#threadEXITtrue, 162#true, 100#L1031true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-02-28 17:20:40,528 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,528 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-02-28 17:20:40,689 INFO  L130       PetriNetUnfolder]: 39413/75193 cut-off events.
[2024-02-28 17:20:40,689 INFO  L131       PetriNetUnfolder]: For 40753/48755 co-relation queries the response was YES.
[2024-02-28 17:20:40,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180406 conditions, 75193 events. 39413/75193 cut-off events. For 40753/48755 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 755451 event pairs, 17234 based on Foata normal form. 1078/70433 useless extension candidates. Maximal degree in co-relation 180395. Up to 34821 conditions per place. 
[2024-02-28 17:20:41,148 INFO  L137   encePairwiseOnDemand]: 244/252 looper letters, 51 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2024-02-28 17:20:41,149 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 766 flow
[2024-02-28 17:20:41,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:20:41,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:20:41,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions.
[2024-02-28 17:20:41,150 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2024-02-28 17:20:41,150 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 453 transitions.
[2024-02-28 17:20:41,150 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions.
[2024-02-28 17:20:41,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:20:41,151 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions.
[2024-02-28 17:20:41,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:41,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:41,152 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:41,152 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 453 transitions.
[2024-02-28 17:20:41,152 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 766 flow
[2024-02-28 17:20:41,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:20:41,875 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2024-02-28 17:20:41,875 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2024-02-28 17:20:41,875 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2024-02-28 17:20:41,876 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2024-02-28 17:20:41,876 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:41,876 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:41,876 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:41,876 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-02-28 17:20:41,877 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:41,877 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:41,877 INFO  L85        PathProgramCache]: Analyzing trace with hash -214994823, now seen corresponding path program 1 times
[2024-02-28 17:20:41,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:41,877 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834405136]
[2024-02-28 17:20:41,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:41,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:41,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:41,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:20:41,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:41,982 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834405136]
[2024-02-28 17:20:41,982 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834405136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:41,982 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:41,982 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:20:41,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021454063]
[2024-02-28 17:20:41,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:41,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:20:41,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:41,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:20:41,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:20:42,222 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 252
[2024-02-28 17:20:42,223 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:42,223 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:42,223 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 252
[2024-02-28 17:20:42,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:20:52,189 INFO  L130       PetriNetUnfolder]: 77040/122336 cut-off events.
[2024-02-28 17:20:52,190 INFO  L131       PetriNetUnfolder]: For 92792/93950 co-relation queries the response was YES.
[2024-02-28 17:20:52,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 335803 conditions, 122336 events. 77040/122336 cut-off events. For 92792/93950 co-relation queries the response was YES. Maximal size of possible extension queue 2947. Compared 1014085 event pairs, 25862 based on Foata normal form. 0/116443 useless extension candidates. Maximal degree in co-relation 335791. Up to 86387 conditions per place. 
[2024-02-28 17:20:52,838 INFO  L137   encePairwiseOnDemand]: 233/252 looper letters, 146 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2024-02-28 17:20:52,839 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1803 flow
[2024-02-28 17:20:52,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:20:52,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:20:52,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions.
[2024-02-28 17:20:52,947 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58994708994709
[2024-02-28 17:20:52,947 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 892 transitions.
[2024-02-28 17:20:52,948 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions.
[2024-02-28 17:20:52,948 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:20:52,948 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions.
[2024-02-28 17:20:52,950 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:52,952 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:52,953 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:52,953 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 892 transitions.
[2024-02-28 17:20:52,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1803 flow
[2024-02-28 17:20:53,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1803 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:20:53,049 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2024-02-28 17:20:53,049 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2024-02-28 17:20:53,050 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2024-02-28 17:20:53,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2024-02-28 17:20:53,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:53,051 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:20:53,051 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:20:53,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-02-28 17:20:53,051 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:20:53,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:20:53,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 135492018, now seen corresponding path program 1 times
[2024-02-28 17:20:53,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:20:53,051 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888045769]
[2024-02-28 17:20:53,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:20:53,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:20:53,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:20:53,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:20:53,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:20:53,193 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888045769]
[2024-02-28 17:20:53,193 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888045769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:20:53,193 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:20:53,193 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:20:53,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304144205]
[2024-02-28 17:20:53,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:20:53,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:20:53,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:20:53,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:20:53,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:20:53,425 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 252
[2024-02-28 17:20:53,426 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:20:53,426 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:20:53,426 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 252
[2024-02-28 17:20:53,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:16,062 INFO  L130       PetriNetUnfolder]: 162624/249129 cut-off events.
[2024-02-28 17:21:16,062 INFO  L131       PetriNetUnfolder]: For 278364/281003 co-relation queries the response was YES.
[2024-02-28 17:21:16,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 804273 conditions, 249129 events. 162624/249129 cut-off events. For 278364/281003 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 2101517 event pairs, 45865 based on Foata normal form. 0/234625 useless extension candidates. Maximal degree in co-relation 804256. Up to 163056 conditions per place. 
[2024-02-28 17:21:17,822 INFO  L137   encePairwiseOnDemand]: 222/252 looper letters, 328 selfloop transitions, 162 changer transitions 0/513 dead transitions.
[2024-02-28 17:21:17,822 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 513 transitions, 4050 flow
[2024-02-28 17:21:17,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:17,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:17,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 913 transitions.
[2024-02-28 17:21:17,824 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6038359788359788
[2024-02-28 17:21:17,824 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 913 transitions.
[2024-02-28 17:21:17,824 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 913 transitions.
[2024-02-28 17:21:17,825 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:17,825 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 913 transitions.
[2024-02-28 17:21:17,841 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:21:17,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:21:17,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 252.0) internal successors, (1764), 7 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:21:17,842 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 913 transitions.
[2024-02-28 17:21:17,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 513 transitions, 4050 flow
[2024-02-28 17:21:19,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 513 transitions, 4050 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:19,093 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2024-02-28 17:21:19,093 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2024-02-28 17:21:19,094 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2024-02-28 17:21:19,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2024-02-28 17:21:19,094 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:21:19,094 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:19,094 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:19,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-02-28 17:21:19,094 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:21:19,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:19,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -728071784, now seen corresponding path program 1 times
[2024-02-28 17:21:19,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:19,095 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823859228]
[2024-02-28 17:21:19,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:19,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:19,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:19,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:21:19,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:19,291 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823859228]
[2024-02-28 17:21:19,291 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823859228] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:21:19,291 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407948779]
[2024-02-28 17:21:19,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:19,291 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:21:19,291 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:21:19,292 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 17:21:19,294 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 17:21:19,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:19,425 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-02-28 17:21:19,426 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:21:19,482 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:21:19,502 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,502 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 17:21:19,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,534 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 17:21:19,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 17:21:19,618 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:19,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:21:19,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:21:19,644 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:21:19,659 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2024-02-28 17:21:19,684 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-02-28 17:21:19,701 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-02-28 17:21:19,718 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1394 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-02-28 17:21:19,732 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:21:19,732 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-02-28 17:21:19,737 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:21:19,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-02-28 17:21:19,740 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-02-28 17:21:19,751 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:21:19,751 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 17:21:19,759 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:21:19,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 17:21:19,765 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:21:19,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 17:21:19,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2024-02-28 17:21:19,782 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407948779] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:21:19,782 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:21:19,783 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-02-28 17:21:19,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080281266]
[2024-02-28 17:21:19,783 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:21:19,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-02-28 17:21:19,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:19,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-02-28 17:21:19,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2024-02-28 17:21:19,822 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 252
[2024-02-28 17:21:19,824 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:21:19,824 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:19,824 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 252
[2024-02-28 17:21:19,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:22:00,631 INFO  L130       PetriNetUnfolder]: 262228/374403 cut-off events.
[2024-02-28 17:22:00,631 INFO  L131       PetriNetUnfolder]: For 829035/829091 co-relation queries the response was YES.
[2024-02-28 17:22:01,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1442117 conditions, 374403 events. 262228/374403 cut-off events. For 829035/829091 co-relation queries the response was YES. Maximal size of possible extension queue 6768. Compared 2851851 event pairs, 128518 based on Foata normal form. 6294/351963 useless extension candidates. Maximal degree in co-relation 1442095. Up to 356440 conditions per place. 
[2024-02-28 17:22:03,466 INFO  L137   encePairwiseOnDemand]: 235/252 looper letters, 436 selfloop transitions, 7 changer transitions 11/463 dead transitions.
[2024-02-28 17:22:03,466 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 463 transitions, 4540 flow
[2024-02-28 17:22:03,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:22:03,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:22:03,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions.
[2024-02-28 17:22:03,468 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.42913832199546487
[2024-02-28 17:22:03,469 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 757 transitions.
[2024-02-28 17:22:03,469 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions.
[2024-02-28 17:22:03,469 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:22:03,469 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions.
[2024-02-28 17:22:03,470 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:22:03,471 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:22:03,471 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 252.0) internal successors, (2016), 8 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:22:03,471 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 757 transitions.
[2024-02-28 17:22:03,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 463 transitions, 4540 flow
[2024-02-28 17:22:30,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 463 transitions, 4444 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-02-28 17:22:30,623 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2024-02-28 17:22:30,623 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2024-02-28 17:22:30,623 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2024-02-28 17:22:30,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2024-02-28 17:22:30,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:22:30,624 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:22:30,624 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:22:30,631 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 17:22:30,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-02-28 17:22:30,825 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-02-28 17:22:30,826 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:22:30,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193830377, now seen corresponding path program 1 times
[2024-02-28 17:22:30,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:22:30,826 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724477245]
[2024-02-28 17:22:30,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:22:30,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:22:30,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:22:31,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:22:31,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:22:31,016 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724477245]
[2024-02-28 17:22:31,016 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724477245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:22:31,017 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:22:31,017 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:22:31,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281994603]
[2024-02-28 17:22:31,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:22:31,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:22:31,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:22:31,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:22:31,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:22:31,339 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 252
[2024-02-28 17:22:31,340 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:22:31,340 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:22:31,340 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 252
[2024-02-28 17:22:31,340 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
