./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_safe-10-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_safe-10-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 a48fe857d08ac3a4ba438de35e4bd3e7e5363b4267f7ed4ba2475f684ca08cd5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:42:22,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:42:23,053 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:42:23,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:42:23,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:42:23,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:42:23,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:42:23,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:42:23,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:42:23,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:42:23,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:42:23,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:42:23,090 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:42:23,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:42:23,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:42:23,092 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:42:23,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:42:23,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:42:23,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:42:23,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:42:23,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:42:23,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:42:23,099 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:42:23,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:42:23,099 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:42:23,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:42:23,100 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:42:23,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:42:23,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:42:23,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:42:23,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:42:23,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:42:23,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:42:23,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:42:23,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:42:23,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:42:23,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:42:23,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:42:23,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:42:23,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:42:23,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:42:23,107 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a48fe857d08ac3a4ba438de35e4bd3e7e5363b4267f7ed4ba2475f684ca08cd5 [2023-11-26 10:42:23,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:42:23,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:42:23,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:42:23,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:42:23,460 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:42:23,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread/fib_safe-10-racy.i [2023-11-26 10:42:26,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:42:26,802 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:42:26,803 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/sv-benchmarks/c/pthread/fib_safe-10-racy.i [2023-11-26 10:42:26,820 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/data/4d2205120/2c0f0f07998042fcac5ac77ef199689b/FLAG0c77c0474 [2023-11-26 10:42:26,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/data/4d2205120/2c0f0f07998042fcac5ac77ef199689b [2023-11-26 10:42:26,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:42:26,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:42:26,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:42:26,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:42:26,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:42:26,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:42:26" (1/1) ... [2023-11-26 10:42:26,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a86dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:26, skipping insertion in model container [2023-11-26 10:42:26,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:42:26" (1/1) ... [2023-11-26 10:42:26,909 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:42:27,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:42:27,393 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:42:27,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:42:27,511 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:42:27,511 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:42:27,519 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:42:27,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27 WrapperNode [2023-11-26 10:42:27,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:42:27,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:42:27,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:42:27,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:42:27,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,599 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-11-26 10:42:27,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:42:27,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:42:27,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:42:27,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:42:27,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:42:27,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:42:27,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:42:27,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:42:27,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (1/1) ... [2023-11-26 10:42:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:42:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:27,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:42:27,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:42:27,767 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-26 10:42:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-26 10:42:27,767 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-26 10:42:27,767 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-26 10:42:27,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:42:27,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:42:27,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:42:27,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:42:27,770 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:42:27,921 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:42:27,923 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:42:28,220 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:42:28,294 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:42:28,298 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-26 10:42:28,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:28 BoogieIcfgContainer [2023-11-26 10:42:28,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:42:28,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:42:28,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:42:28,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:42:28,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:42:26" (1/3) ... [2023-11-26 10:42:28,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a1a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:42:28, skipping insertion in model container [2023-11-26 10:42:28,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:27" (2/3) ... [2023-11-26 10:42:28,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432a1a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:42:28, skipping insertion in model container [2023-11-26 10:42:28,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:28" (3/3) ... [2023-11-26 10:42:28,339 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-10-racy.i [2023-11-26 10:42:28,348 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:42:28,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:42:28,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-26 10:42:28,360 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:42:28,426 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:42:28,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 193 transitions, 394 flow [2023-11-26 10:42:28,556 INFO L124 PetriNetUnfolderBase]: 9/191 cut-off events. [2023-11-26 10:42:28,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:28,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 9/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 394 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2023-11-26 10:42:28,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 193 transitions, 394 flow [2023-11-26 10:42:28,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 191 transitions, 388 flow [2023-11-26 10:42:28,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:42:28,613 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=LoopHeads, 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;@696c361e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:42:28,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-26 10:42:28,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:42:28,622 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-26 10:42:28,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:28,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:28,623 INFO L208 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] [2023-11-26 10:42:28,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:28,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1678568219, now seen corresponding path program 1 times [2023-11-26 10:42:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604469456] [2023-11-26 10:42:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604469456] [2023-11-26 10:42:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604469456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:42:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121310645] [2023-11-26 10:42:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:42:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:42:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:42:28,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 193 [2023-11-26 10:42:28,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 388 flow. Second operand has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 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) [2023-11-26 10:42:28,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:28,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 193 [2023-11-26 10:42:28,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:29,016 INFO L124 PetriNetUnfolderBase]: 9/294 cut-off events. [2023-11-26 10:42:29,016 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:42:29,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 294 events. 9/294 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 977 event pairs, 2 based on Foata normal form. 12/256 useless extension candidates. Maximal degree in co-relation 278. Up to 11 conditions per place. [2023-11-26 10:42:29,024 INFO L140 encePairwiseOnDemand]: 180/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/175 dead transitions. [2023-11-26 10:42:29,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 175 transitions, 368 flow [2023-11-26 10:42:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:42:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:42:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 365 transitions. [2023-11-26 10:42:29,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9455958549222798 [2023-11-26 10:42:29,040 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 365 transitions. [2023-11-26 10:42:29,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 365 transitions. [2023-11-26 10:42:29,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:29,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 365 transitions. [2023-11-26 10:42:29,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 182.5) internal successors, (365), 2 states have internal predecessors, (365), 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) [2023-11-26 10:42:29,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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) [2023-11-26 10:42:29,057 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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) [2023-11-26 10:42:29,059 INFO L175 Difference]: Start difference. First operand has 189 places, 191 transitions, 388 flow. Second operand 2 states and 365 transitions. [2023-11-26 10:42:29,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 175 transitions, 368 flow [2023-11-26 10:42:29,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 175 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:29,069 INFO L231 Difference]: Finished difference. Result has 177 places, 175 transitions, 354 flow [2023-11-26 10:42:29,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=354, PETRI_PLACES=177, PETRI_TRANSITIONS=175} [2023-11-26 10:42:29,079 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -12 predicate places. [2023-11-26 10:42:29,080 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 175 transitions, 354 flow [2023-11-26 10:42:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 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) [2023-11-26 10:42:29,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:29,081 INFO L208 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, 1, 1, 1, 1] [2023-11-26 10:42:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:42:29,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:29,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -495615639, now seen corresponding path program 1 times [2023-11-26 10:42:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608374627] [2023-11-26 10:42:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608374627] [2023-11-26 10:42:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608374627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047531714] [2023-11-26 10:42:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:29,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:29,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:29,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 175 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:29,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:29,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:29,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:29,397 INFO L124 PetriNetUnfolderBase]: 30/374 cut-off events. [2023-11-26 10:42:29,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:29,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 374 events. 30/374 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1694 event pairs, 8 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 444. Up to 41 conditions per place. [2023-11-26 10:42:29,439 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2023-11-26 10:42:29,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 176 transitions, 388 flow [2023-11-26 10:42:29,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-11-26 10:42:29,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2023-11-26 10:42:29,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:29,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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) [2023-11-26 10:42:29,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,460 INFO L175 Difference]: Start difference. First operand has 177 places, 175 transitions, 354 flow. Second operand 3 states and 511 transitions. [2023-11-26 10:42:29,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 176 transitions, 388 flow [2023-11-26 10:42:29,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 176 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:42:29,466 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2023-11-26 10:42:29,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2023-11-26 10:42:29,468 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -11 predicate places. [2023-11-26 10:42:29,468 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2023-11-26 10:42:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:29,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:29,469 INFO L208 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:29,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:42:29,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:29,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1212581605, now seen corresponding path program 1 times [2023-11-26 10:42:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154641352] [2023-11-26 10:42:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154641352] [2023-11-26 10:42:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154641352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812510718] [2023-11-26 10:42:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:29,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:29,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:29,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:29,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:29,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:29,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:29,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:29,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:29,629 INFO L124 PetriNetUnfolderBase]: 20/226 cut-off events. [2023-11-26 10:42:29,629 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:42:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 226 events. 20/226 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 807 event pairs, 4 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 290. Up to 25 conditions per place. [2023-11-26 10:42:29,638 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 12 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-11-26 10:42:29,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 174 transitions, 386 flow [2023-11-26 10:42:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-11-26 10:42:29,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2023-11-26 10:42:29,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:29,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-11-26 10:42:29,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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) [2023-11-26 10:42:29,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,648 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 511 transitions. [2023-11-26 10:42:29,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 174 transitions, 386 flow [2023-11-26 10:42:29,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 174 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:29,656 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2023-11-26 10:42:29,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2023-11-26 10:42:29,658 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -13 predicate places. [2023-11-26 10:42:29,659 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2023-11-26 10:42:29,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:29,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:29,660 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:29,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:42:29,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:29,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -87959945, now seen corresponding path program 1 times [2023-11-26 10:42:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705484455] [2023-11-26 10:42:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705484455] [2023-11-26 10:42:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705484455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372879879] [2023-11-26 10:42:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:29,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:29,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:29,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:29,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:29,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:29,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:29,916 INFO L124 PetriNetUnfolderBase]: 16/296 cut-off events. [2023-11-26 10:42:29,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:29,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 296 events. 16/296 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1112 event pairs, 7 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 335. Up to 26 conditions per place. [2023-11-26 10:42:29,921 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 12 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-11-26 10:42:29,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 172 transitions, 380 flow [2023-11-26 10:42:29,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-11-26 10:42:29,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8808290155440415 [2023-11-26 10:42:29,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-11-26 10:42:29,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-11-26 10:42:29,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:29,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-11-26 10:42:29,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-11-26 10:42:29,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:29,933 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 510 transitions. [2023-11-26 10:42:29,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 172 transitions, 380 flow [2023-11-26 10:42:29,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:29,938 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2023-11-26 10:42:29,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=171} [2023-11-26 10:42:29,941 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -14 predicate places. [2023-11-26 10:42:29,941 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2023-11-26 10:42:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:29,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:29,943 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:29,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:42:29,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:29,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash -484121739, now seen corresponding path program 1 times [2023-11-26 10:42:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669975195] [2023-11-26 10:42:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669975195] [2023-11-26 10:42:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669975195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833094506] [2023-11-26 10:42:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:30,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:30,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:30,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:30,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:30,113 INFO L124 PetriNetUnfolderBase]: 15/291 cut-off events. [2023-11-26 10:42:30,113 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 10:42:30,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 291 events. 15/291 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1064 event pairs, 3 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 329. Up to 15 conditions per place. [2023-11-26 10:42:30,118 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2023-11-26 10:42:30,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 374 flow [2023-11-26 10:42:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-11-26 10:42:30,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8808290155440415 [2023-11-26 10:42:30,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-11-26 10:42:30,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-11-26 10:42:30,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-11-26 10:42:30,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-11-26 10:42:30,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,128 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 510 transitions. [2023-11-26 10:42:30,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 170 transitions, 374 flow [2023-11-26 10:42:30,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:30,133 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 346 flow [2023-11-26 10:42:30,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2023-11-26 10:42:30,134 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -16 predicate places. [2023-11-26 10:42:30,135 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 346 flow [2023-11-26 10:42:30,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:30,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:30,136 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:42:30,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:30,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 498936638, now seen corresponding path program 1 times [2023-11-26 10:42:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946681692] [2023-11-26 10:42:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:30,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946681692] [2023-11-26 10:42:30,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946681692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:30,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:30,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862024805] [2023-11-26 10:42:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:30,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:30,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 193 [2023-11-26 10:42:30,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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) [2023-11-26 10:42:30,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:30,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 193 [2023-11-26 10:42:30,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:30,409 INFO L124 PetriNetUnfolderBase]: 49/491 cut-off events. [2023-11-26 10:42:30,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:30,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 491 events. 49/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2640 event pairs, 30 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 583. Up to 67 conditions per place. [2023-11-26 10:42:30,416 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2023-11-26 10:42:30,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2023-11-26 10:42:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-26 10:42:30,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756476683937824 [2023-11-26 10:42:30,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-26 10:42:30,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-26 10:42:30,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:30,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-26 10:42:30,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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) [2023-11-26 10:42:30,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,426 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 346 flow. Second operand 3 states and 507 transitions. [2023-11-26 10:42:30,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2023-11-26 10:42:30,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:30,431 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2023-11-26 10:42:30,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2023-11-26 10:42:30,435 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -17 predicate places. [2023-11-26 10:42:30,435 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2023-11-26 10:42:30,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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) [2023-11-26 10:42:30,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:30,436 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:30,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:42:30,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:30,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1060095838, now seen corresponding path program 1 times [2023-11-26 10:42:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017351423] [2023-11-26 10:42:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:30,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017351423] [2023-11-26 10:42:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017351423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553913906] [2023-11-26 10:42:30,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:30,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:30,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:30,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:30,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:30,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:30,656 INFO L124 PetriNetUnfolderBase]: 37/465 cut-off events. [2023-11-26 10:42:30,656 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:42:30,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 465 events. 37/465 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2335 event pairs, 10 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 537. Up to 32 conditions per place. [2023-11-26 10:42:30,661 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-11-26 10:42:30,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 372 flow [2023-11-26 10:42:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-11-26 10:42:30,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2023-11-26 10:42:30,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:30,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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) [2023-11-26 10:42:30,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,671 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 511 transitions. [2023-11-26 10:42:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 372 flow [2023-11-26 10:42:30,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:30,675 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow [2023-11-26 10:42:30,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2023-11-26 10:42:30,678 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -19 predicate places. [2023-11-26 10:42:30,679 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow [2023-11-26 10:42:30,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:30,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:30,680 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:30,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:42:30,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:30,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1246894669, now seen corresponding path program 1 times [2023-11-26 10:42:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112188939] [2023-11-26 10:42:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112188939] [2023-11-26 10:42:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112188939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299411329] [2023-11-26 10:42:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:30,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:30,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:30,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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) [2023-11-26 10:42:30,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:30,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:30,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:30,862 INFO L124 PetriNetUnfolderBase]: 20/217 cut-off events. [2023-11-26 10:42:30,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:30,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 217 events. 20/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 740 event pairs, 10 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 280. Up to 34 conditions per place. [2023-11-26 10:42:30,865 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2023-11-26 10:42:30,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 167 transitions, 374 flow [2023-11-26 10:42:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-11-26 10:42:30,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2023-11-26 10:42:30,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:30,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-11-26 10:42:30,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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) [2023-11-26 10:42:30,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:30,873 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 511 transitions. [2023-11-26 10:42:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 167 transitions, 374 flow [2023-11-26 10:42:30,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 167 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:30,877 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 338 flow [2023-11-26 10:42:30,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2023-11-26 10:42:30,881 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -20 predicate places. [2023-11-26 10:42:30,881 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 338 flow [2023-11-26 10:42:30,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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) [2023-11-26 10:42:30,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:30,882 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:42:30,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:30,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -420220774, now seen corresponding path program 1 times [2023-11-26 10:42:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645881998] [2023-11-26 10:42:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645881998] [2023-11-26 10:42:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645881998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:30,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:42:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719232616] [2023-11-26 10:42:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:30,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:30,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 193 [2023-11-26 10:42:30,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-26 10:42:30,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 193 [2023-11-26 10:42:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:31,091 INFO L124 PetriNetUnfolderBase]: 25/604 cut-off events. [2023-11-26 10:42:31,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:31,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 604 events. 25/604 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2698 event pairs, 6 based on Foata normal form. 4/520 useless extension candidates. Maximal degree in co-relation 651. Up to 21 conditions per place. [2023-11-26 10:42:31,098 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-11-26 10:42:31,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 370 flow [2023-11-26 10:42:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-11-26 10:42:31,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8998272884283247 [2023-11-26 10:42:31,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-11-26 10:42:31,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-11-26 10:42:31,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:31,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-11-26 10:42:31,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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) [2023-11-26 10:42:31,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,106 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 338 flow. Second operand 3 states and 521 transitions. [2023-11-26 10:42:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 168 transitions, 370 flow [2023-11-26 10:42:31,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 168 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:31,111 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 346 flow [2023-11-26 10:42:31,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2023-11-26 10:42:31,112 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -19 predicate places. [2023-11-26 10:42:31,113 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 346 flow [2023-11-26 10:42:31,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-26 10:42:31,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:31,113 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:31,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:42:31,114 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:31,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash -420221410, now seen corresponding path program 1 times [2023-11-26 10:42:31,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:31,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433251730] [2023-11-26 10:42:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433251730] [2023-11-26 10:42:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433251730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852820297] [2023-11-26 10:42:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:31,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:31,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2023-11-26 10:42:31,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-11-26 10:42:31,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:31,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2023-11-26 10:42:31,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:31,335 INFO L124 PetriNetUnfolderBase]: 55/588 cut-off events. [2023-11-26 10:42:31,336 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:42:31,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 588 events. 55/588 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2607 event pairs, 10 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 689. Up to 56 conditions per place. [2023-11-26 10:42:31,346 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 10 selfloop transitions, 3 changer transitions 0/166 dead transitions. [2023-11-26 10:42:31,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 372 flow [2023-11-26 10:42:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-11-26 10:42:31,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8860103626943006 [2023-11-26 10:42:31,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:31,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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) [2023-11-26 10:42:31,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,355 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 346 flow. Second operand 3 states and 513 transitions. [2023-11-26 10:42:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 372 flow [2023-11-26 10:42:31,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:31,359 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 346 flow [2023-11-26 10:42:31,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2023-11-26 10:42:31,361 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -20 predicate places. [2023-11-26 10:42:31,362 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 346 flow [2023-11-26 10:42:31,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-11-26 10:42:31,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:31,362 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:31,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:42:31,363 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:31,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash -105833620, now seen corresponding path program 1 times [2023-11-26 10:42:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049609926] [2023-11-26 10:42:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:31,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049609926] [2023-11-26 10:42:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049609926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:31,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922358177] [2023-11-26 10:42:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:31,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:31,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:31,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2023-11-26 10:42:31,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-11-26 10:42:31,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:31,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2023-11-26 10:42:31,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:31,550 INFO L124 PetriNetUnfolderBase]: 61/542 cut-off events. [2023-11-26 10:42:31,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:31,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 542 events. 61/542 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2376 event pairs, 10 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 671. Up to 72 conditions per place. [2023-11-26 10:42:31,557 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-26 10:42:31,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 372 flow [2023-11-26 10:42:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-11-26 10:42:31,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8860103626943006 [2023-11-26 10:42:31,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:31,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-11-26 10:42:31,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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) [2023-11-26 10:42:31,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,565 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 346 flow. Second operand 3 states and 513 transitions. [2023-11-26 10:42:31,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 372 flow [2023-11-26 10:42:31,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:31,576 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2023-11-26 10:42:31,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2023-11-26 10:42:31,577 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -22 predicate places. [2023-11-26 10:42:31,577 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2023-11-26 10:42:31,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-11-26 10:42:31,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:31,578 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:31,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:42:31,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:31,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash 919608385, now seen corresponding path program 1 times [2023-11-26 10:42:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:31,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482443573] [2023-11-26 10:42:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:31,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482443573] [2023-11-26 10:42:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482443573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:31,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:31,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799860271] [2023-11-26 10:42:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:31,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:31,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:31,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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) [2023-11-26 10:42:31,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:31,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:31,727 INFO L124 PetriNetUnfolderBase]: 15/342 cut-off events. [2023-11-26 10:42:31,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:31,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 342 events. 15/342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 991 event pairs, 6 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 393. Up to 25 conditions per place. [2023-11-26 10:42:31,732 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 12 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-11-26 10:42:31,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 368 flow [2023-11-26 10:42:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-11-26 10:42:31,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8808290155440415 [2023-11-26 10:42:31,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-11-26 10:42:31,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-11-26 10:42:31,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:31,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-11-26 10:42:31,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-11-26 10:42:31,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,740 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 510 transitions. [2023-11-26 10:42:31,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 368 flow [2023-11-26 10:42:31,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:31,745 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 338 flow [2023-11-26 10:42:31,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2023-11-26 10:42:31,746 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -23 predicate places. [2023-11-26 10:42:31,746 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 338 flow [2023-11-26 10:42:31,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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) [2023-11-26 10:42:31,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:31,747 INFO L208 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, 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] [2023-11-26 10:42:31,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:42:31,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:31,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1014768213, now seen corresponding path program 1 times [2023-11-26 10:42:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052063990] [2023-11-26 10:42:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:31,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052063990] [2023-11-26 10:42:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052063990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192960559] [2023-11-26 10:42:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:31,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:31,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:31,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2023-11-26 10:42:31,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2023-11-26 10:42:31,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:31,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2023-11-26 10:42:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:31,938 INFO L124 PetriNetUnfolderBase]: 61/604 cut-off events. [2023-11-26 10:42:31,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:31,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 604 events. 61/604 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2964 event pairs, 34 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 733. Up to 75 conditions per place. [2023-11-26 10:42:31,944 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2023-11-26 10:42:31,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 370 flow [2023-11-26 10:42:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2023-11-26 10:42:31,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2023-11-26 10:42:31,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2023-11-26 10:42:31,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2023-11-26 10:42:31,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:31,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2023-11-26 10:42:31,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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) [2023-11-26 10:42:31,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:31,952 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 338 flow. Second operand 3 states and 511 transitions. [2023-11-26 10:42:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 370 flow [2023-11-26 10:42:31,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:31,958 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 336 flow [2023-11-26 10:42:31,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2023-11-26 10:42:31,959 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -24 predicate places. [2023-11-26 10:42:31,960 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 336 flow [2023-11-26 10:42:31,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2023-11-26 10:42:31,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:31,960 INFO L208 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, 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, 1, 1, 1, 1] [2023-11-26 10:42:31,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:42:31,961 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:31,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -952634815, now seen corresponding path program 1 times [2023-11-26 10:42:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:31,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737640114] [2023-11-26 10:42:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737640114] [2023-11-26 10:42:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737640114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:32,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471535958] [2023-11-26 10:42:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:32,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:32,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:32,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:32,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:32,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:32,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:32,123 INFO L124 PetriNetUnfolderBase]: 65/600 cut-off events. [2023-11-26 10:42:32,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:32,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 600 events. 65/600 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3021 event pairs, 38 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 749. Up to 83 conditions per place. [2023-11-26 10:42:32,129 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2023-11-26 10:42:32,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 370 flow [2023-11-26 10:42:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-26 10:42:32,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2023-11-26 10:42:32,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:32,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-11-26 10:42:32,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,137 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 336 flow. Second operand 3 states and 509 transitions. [2023-11-26 10:42:32,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 370 flow [2023-11-26 10:42:32,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:32,142 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 334 flow [2023-11-26 10:42:32,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2023-11-26 10:42:32,143 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -25 predicate places. [2023-11-26 10:42:32,143 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 334 flow [2023-11-26 10:42:32,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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) [2023-11-26 10:42:32,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:32,144 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:42:32,144 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1200574010, now seen corresponding path program 1 times [2023-11-26 10:42:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970530187] [2023-11-26 10:42:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:32,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:32,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970530187] [2023-11-26 10:42:32,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970530187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:32,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245400148] [2023-11-26 10:42:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:32,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:32,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:32,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 193 [2023-11-26 10:42:32,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-26 10:42:32,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:32,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 193 [2023-11-26 10:42:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:32,322 INFO L124 PetriNetUnfolderBase]: 49/570 cut-off events. [2023-11-26 10:42:32,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:32,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 570 events. 49/570 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2530 event pairs, 10 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 667. Up to 40 conditions per place. [2023-11-26 10:42:32,329 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 10 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2023-11-26 10:42:32,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 362 flow [2023-11-26 10:42:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2023-11-26 10:42:32,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8981001727115717 [2023-11-26 10:42:32,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2023-11-26 10:42:32,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2023-11-26 10:42:32,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:32,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2023-11-26 10:42:32,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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) [2023-11-26 10:42:32,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,337 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 334 flow. Second operand 3 states and 520 transitions. [2023-11-26 10:42:32,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 362 flow [2023-11-26 10:42:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:32,342 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 338 flow [2023-11-26 10:42:32,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2023-11-26 10:42:32,343 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -25 predicate places. [2023-11-26 10:42:32,343 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 338 flow [2023-11-26 10:42:32,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-26 10:42:32,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:32,344 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:32,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:42:32,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:32,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 923132931, now seen corresponding path program 1 times [2023-11-26 10:42:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:32,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684715538] [2023-11-26 10:42:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684715538] [2023-11-26 10:42:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684715538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:32,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42912818] [2023-11-26 10:42:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:32,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:32,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:32,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:32,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:32,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:32,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:32,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:32,511 INFO L124 PetriNetUnfolderBase]: 69/588 cut-off events. [2023-11-26 10:42:32,511 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 10:42:32,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 588 events. 69/588 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2970 event pairs, 42 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 749. Up to 91 conditions per place. [2023-11-26 10:42:32,518 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-11-26 10:42:32,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 372 flow [2023-11-26 10:42:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-26 10:42:32,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2023-11-26 10:42:32,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:32,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-26 10:42:32,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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) [2023-11-26 10:42:32,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,538 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 338 flow. Second operand 3 states and 509 transitions. [2023-11-26 10:42:32,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 372 flow [2023-11-26 10:42:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:32,543 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 338 flow [2023-11-26 10:42:32,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2023-11-26 10:42:32,544 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -25 predicate places. [2023-11-26 10:42:32,544 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 338 flow [2023-11-26 10:42:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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) [2023-11-26 10:42:32,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:32,545 INFO L208 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:32,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:42:32,545 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:32,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -957748646, now seen corresponding path program 1 times [2023-11-26 10:42:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47226230] [2023-11-26 10:42:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47226230] [2023-11-26 10:42:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47226230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788186708] [2023-11-26 10:42:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:32,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:32,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 193 [2023-11-26 10:42:32,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2023-11-26 10:42:32,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:32,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 193 [2023-11-26 10:42:32,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:32,714 INFO L124 PetriNetUnfolderBase]: 57/572 cut-off events. [2023-11-26 10:42:32,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:32,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 572 events. 57/572 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2631 event pairs, 38 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2023-11-26 10:42:32,720 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-11-26 10:42:32,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 159 transitions, 374 flow [2023-11-26 10:42:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-26 10:42:32,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8756476683937824 [2023-11-26 10:42:32,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-26 10:42:32,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-26 10:42:32,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:32,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-26 10:42:32,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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) [2023-11-26 10:42:32,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:32,728 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 338 flow. Second operand 3 states and 507 transitions. [2023-11-26 10:42:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 159 transitions, 374 flow [2023-11-26 10:42:32,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 159 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:32,732 INFO L231 Difference]: Finished difference. Result has 163 places, 157 transitions, 336 flow [2023-11-26 10:42:32,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=163, PETRI_TRANSITIONS=157} [2023-11-26 10:42:32,733 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -26 predicate places. [2023-11-26 10:42:32,733 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 157 transitions, 336 flow [2023-11-26 10:42:32,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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) [2023-11-26 10:42:32,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:32,734 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1] [2023-11-26 10:42:32,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:42:32,735 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:32,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 227043692, now seen corresponding path program 1 times [2023-11-26 10:42:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097757663] [2023-11-26 10:42:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097757663] [2023-11-26 10:42:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097757663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884845354] [2023-11-26 10:42:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:32,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:32,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:42:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:32,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:42:32,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:42:33,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:42:33,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884845354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:33,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:42:33,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-26 10:42:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636208653] [2023-11-26 10:42:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:42:33,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2023-11-26 10:42:33,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 157 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-26 10:42:33,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:33,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2023-11-26 10:42:33,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:33,105 INFO L124 PetriNetUnfolderBase]: 36/501 cut-off events. [2023-11-26 10:42:33,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:33,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 501 events. 36/501 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1944 event pairs, 1 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 579. Up to 31 conditions per place. [2023-11-26 10:42:33,111 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/161 dead transitions. [2023-11-26 10:42:33,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 370 flow [2023-11-26 10:42:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-11-26 10:42:33,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9050086355785838 [2023-11-26 10:42:33,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-11-26 10:42:33,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-11-26 10:42:33,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:33,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-11-26 10:42:33,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-26 10:42:33,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:33,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:33,119 INFO L175 Difference]: Start difference. First operand has 163 places, 157 transitions, 336 flow. Second operand 3 states and 524 transitions. [2023-11-26 10:42:33,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 370 flow [2023-11-26 10:42:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:33,123 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 366 flow [2023-11-26 10:42:33,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=165, PETRI_TRANSITIONS=161} [2023-11-26 10:42:33,124 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -24 predicate places. [2023-11-26 10:42:33,124 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 366 flow [2023-11-26 10:42:33,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-26 10:42:33,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:33,125 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:33,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:42:33,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-26 10:42:33,335 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:33,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -675295026, now seen corresponding path program 1 times [2023-11-26 10:42:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292451130] [2023-11-26 10:42:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:33,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292451130] [2023-11-26 10:42:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292451130] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:33,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142416065] [2023-11-26 10:42:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:33,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:33,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:33,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:42:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:33,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:42:33,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 10:42:33,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:42:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142416065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:33,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:42:33,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-26 10:42:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711998096] [2023-11-26 10:42:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:33,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:42:33,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 193 [2023-11-26 10:42:33,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-26 10:42:33,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:33,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 193 [2023-11-26 10:42:33,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:33,799 INFO L124 PetriNetUnfolderBase]: 78/637 cut-off events. [2023-11-26 10:42:33,799 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2023-11-26 10:42:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 637 events. 78/637 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3072 event pairs, 0 based on Foata normal form. 8/600 useless extension candidates. Maximal degree in co-relation 901. Up to 59 conditions per place. [2023-11-26 10:42:33,807 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/168 dead transitions. [2023-11-26 10:42:33,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 168 transitions, 430 flow [2023-11-26 10:42:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-11-26 10:42:33,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9067357512953368 [2023-11-26 10:42:33,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-11-26 10:42:33,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-11-26 10:42:33,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:33,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-11-26 10:42:33,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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) [2023-11-26 10:42:33,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:33,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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) [2023-11-26 10:42:33,815 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 366 flow. Second operand 3 states and 525 transitions. [2023-11-26 10:42:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 168 transitions, 430 flow [2023-11-26 10:42:33,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 168 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:33,820 INFO L231 Difference]: Finished difference. Result has 167 places, 167 transitions, 416 flow [2023-11-26 10:42:33,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2023-11-26 10:42:33,821 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -22 predicate places. [2023-11-26 10:42:33,822 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 416 flow [2023-11-26 10:42:33,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-26 10:42:33,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:33,822 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:33,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:42:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:34,028 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:34,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 537321108, now seen corresponding path program 1 times [2023-11-26 10:42:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405150032] [2023-11-26 10:42:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:34,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405150032] [2023-11-26 10:42:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405150032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:34,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634816229] [2023-11-26 10:42:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:34,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:34,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:34,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:34,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:42:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:34,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:42:34,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:34,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:42:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:34,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634816229] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:42:34,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:42:34,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 10:42:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961804078] [2023-11-26 10:42:34,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:42:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:42:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:42:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:42:34,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:34,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 416 flow. Second operand has 10 states, 10 states have (on average 166.4) internal successors, (1664), 10 states have internal predecessors, (1664), 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) [2023-11-26 10:42:34,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:34,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:34,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:34,882 INFO L124 PetriNetUnfolderBase]: 242/1346 cut-off events. [2023-11-26 10:42:34,883 INFO L125 PetriNetUnfolderBase]: For 1040/1070 co-relation queries the response was YES. [2023-11-26 10:42:34,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1346 events. 242/1346 cut-off events. For 1040/1070 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6858 event pairs, 13 based on Foata normal form. 16/1303 useless extension candidates. Maximal degree in co-relation 2382. Up to 138 conditions per place. [2023-11-26 10:42:34,900 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 63 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2023-11-26 10:42:34,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 217 transitions, 872 flow [2023-11-26 10:42:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:42:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:42:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1516 transitions. [2023-11-26 10:42:34,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.872769142199194 [2023-11-26 10:42:34,906 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1516 transitions. [2023-11-26 10:42:34,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1516 transitions. [2023-11-26 10:42:34,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:34,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1516 transitions. [2023-11-26 10:42:34,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.44444444444446) internal successors, (1516), 9 states have internal predecessors, (1516), 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) [2023-11-26 10:42:34,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 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) [2023-11-26 10:42:34,917 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 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) [2023-11-26 10:42:34,918 INFO L175 Difference]: Start difference. First operand has 167 places, 167 transitions, 416 flow. Second operand 9 states and 1516 transitions. [2023-11-26 10:42:34,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 217 transitions, 872 flow [2023-11-26 10:42:34,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 217 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:34,925 INFO L231 Difference]: Finished difference. Result has 176 places, 173 transitions, 454 flow [2023-11-26 10:42:34,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=176, PETRI_TRANSITIONS=173} [2023-11-26 10:42:34,926 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, -13 predicate places. [2023-11-26 10:42:34,926 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 173 transitions, 454 flow [2023-11-26 10:42:34,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.4) internal successors, (1664), 10 states have internal predecessors, (1664), 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) [2023-11-26 10:42:34,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:34,928 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:34,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:42:35,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:35,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:35,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash -72120108, now seen corresponding path program 2 times [2023-11-26 10:42:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861197222] [2023-11-26 10:42:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861197222] [2023-11-26 10:42:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861197222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196648549] [2023-11-26 10:42:35,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:42:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:35,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:35,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:42:35,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 10:42:35,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:42:35,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 10:42:35,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:35,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:42:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:36,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196648549] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:42:36,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:42:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-26 10:42:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19926611] [2023-11-26 10:42:36,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:42:36,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-26 10:42:36,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:36,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 10:42:36,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-26 10:42:36,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:36,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 173 transitions, 454 flow. Second operand has 18 states, 18 states have (on average 166.22222222222223) internal successors, (2992), 18 states have internal predecessors, (2992), 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) [2023-11-26 10:42:36,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:36,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:36,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:36,989 INFO L124 PetriNetUnfolderBase]: 402/2206 cut-off events. [2023-11-26 10:42:36,990 INFO L125 PetriNetUnfolderBase]: For 1541/1572 co-relation queries the response was YES. [2023-11-26 10:42:37,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3957 conditions, 2206 events. 402/2206 cut-off events. For 1541/1572 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 10925 event pairs, 13 based on Foata normal form. 26/2171 useless extension candidates. Maximal degree in co-relation 3947. Up to 218 conditions per place. [2023-11-26 10:42:37,014 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 139 selfloop transitions, 21 changer transitions 0/305 dead transitions. [2023-11-26 10:42:37,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 305 transitions, 1554 flow [2023-11-26 10:42:37,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 10:42:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-26 10:42:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3526 transitions. [2023-11-26 10:42:37,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8699728596101653 [2023-11-26 10:42:37,027 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3526 transitions. [2023-11-26 10:42:37,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3526 transitions. [2023-11-26 10:42:37,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:37,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3526 transitions. [2023-11-26 10:42:37,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 167.9047619047619) internal successors, (3526), 21 states have internal predecessors, (3526), 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) [2023-11-26 10:42:37,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 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) [2023-11-26 10:42:37,053 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 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) [2023-11-26 10:42:37,053 INFO L175 Difference]: Start difference. First operand has 176 places, 173 transitions, 454 flow. Second operand 21 states and 3526 transitions. [2023-11-26 10:42:37,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 305 transitions, 1554 flow [2023-11-26 10:42:37,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 305 transitions, 1540 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:37,065 INFO L231 Difference]: Finished difference. Result has 200 places, 186 transitions, 578 flow [2023-11-26 10:42:37,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=578, PETRI_PLACES=200, PETRI_TRANSITIONS=186} [2023-11-26 10:42:37,066 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, 11 predicate places. [2023-11-26 10:42:37,067 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 186 transitions, 578 flow [2023-11-26 10:42:37,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 166.22222222222223) internal successors, (2992), 18 states have internal predecessors, (2992), 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) [2023-11-26 10:42:37,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:37,068 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:37,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:42:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:37,276 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:37,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1680919892, now seen corresponding path program 3 times [2023-11-26 10:42:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370640269] [2023-11-26 10:42:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:38,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370640269] [2023-11-26 10:42:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370640269] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098957574] [2023-11-26 10:42:38,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 10:42:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:38,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:38,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 10:42:38,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-26 10:42:38,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:42:38,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-26 10:42:38,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:38,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:42:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:39,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098957574] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:42:39,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:42:39,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-26 10:42:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421847287] [2023-11-26 10:42:39,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:42:39,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-26 10:42:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-26 10:42:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-26 10:42:39,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:39,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 186 transitions, 578 flow. Second operand has 34 states, 34 states have (on average 166.11764705882354) internal successors, (5648), 34 states have internal predecessors, (5648), 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) [2023-11-26 10:42:39,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:39,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:39,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:41,638 INFO L124 PetriNetUnfolderBase]: 722/3926 cut-off events. [2023-11-26 10:42:41,638 INFO L125 PetriNetUnfolderBase]: For 4579/4610 co-relation queries the response was YES. [2023-11-26 10:42:41,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 3926 events. 722/3926 cut-off events. For 4579/4610 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 18842 event pairs, 13 based on Foata normal form. 46/3911 useless extension candidates. Maximal degree in co-relation 7493. Up to 378 conditions per place. [2023-11-26 10:42:41,691 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 291 selfloop transitions, 45 changer transitions 0/481 dead transitions. [2023-11-26 10:42:41,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 481 transitions, 3086 flow [2023-11-26 10:42:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-26 10:42:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-26 10:42:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7546 transitions. [2023-11-26 10:42:41,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8688543465745538 [2023-11-26 10:42:41,711 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7546 transitions. [2023-11-26 10:42:41,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7546 transitions. [2023-11-26 10:42:41,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:41,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7546 transitions. [2023-11-26 10:42:41,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 167.6888888888889) internal successors, (7546), 45 states have internal predecessors, (7546), 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) [2023-11-26 10:42:41,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 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) [2023-11-26 10:42:41,758 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 193.0) internal successors, (8878), 46 states have internal predecessors, (8878), 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) [2023-11-26 10:42:41,759 INFO L175 Difference]: Start difference. First operand has 200 places, 186 transitions, 578 flow. Second operand 45 states and 7546 transitions. [2023-11-26 10:42:41,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 481 transitions, 3086 flow [2023-11-26 10:42:41,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 481 transitions, 3046 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-26 10:42:41,777 INFO L231 Difference]: Finished difference. Result has 247 places, 211 transitions, 856 flow [2023-11-26 10:42:41,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=856, PETRI_PLACES=247, PETRI_TRANSITIONS=211} [2023-11-26 10:42:41,778 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, 58 predicate places. [2023-11-26 10:42:41,779 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 211 transitions, 856 flow [2023-11-26 10:42:41,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 166.11764705882354) internal successors, (5648), 34 states have internal predecessors, (5648), 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) [2023-11-26 10:42:41,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:41,831 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:41,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:42:42,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-26 10:42:42,032 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:42,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1885587870, now seen corresponding path program 4 times [2023-11-26 10:42:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292766604] [2023-11-26 10:42:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:44,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:44,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292766604] [2023-11-26 10:42:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292766604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:42:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620953930] [2023-11-26 10:42:44,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 10:42:44,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:42:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:44,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:42:44,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 10:42:44,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 10:42:44,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:42:44,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-26 10:42:44,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:42:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:45,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:42:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620953930] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:42:47,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:42:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 47 [2023-11-26 10:42:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238870944] [2023-11-26 10:42:47,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:42:47,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-26 10:42:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-26 10:42:47,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2023-11-26 10:42:47,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2023-11-26 10:42:47,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 211 transitions, 856 flow. Second operand has 47 states, 47 states have (on average 166.12765957446808) internal successors, (7808), 47 states have internal predecessors, (7808), 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) [2023-11-26 10:42:47,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:47,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2023-11-26 10:42:47,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:51,396 INFO L124 PetriNetUnfolderBase]: 1002/5431 cut-off events. [2023-11-26 10:42:51,396 INFO L125 PetriNetUnfolderBase]: For 10688/10719 co-relation queries the response was YES. [2023-11-26 10:42:51,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10928 conditions, 5431 events. 1002/5431 cut-off events. For 10688/10719 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 25881 event pairs, 13 based on Foata normal form. 41/5411 useless extension candidates. Maximal degree in co-relation 10904. Up to 518 conditions per place. [2023-11-26 10:42:51,463 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 424 selfloop transitions, 66 changer transitions 0/635 dead transitions. [2023-11-26 10:42:51,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 635 transitions, 4550 flow [2023-11-26 10:42:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-26 10:42:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-11-26 10:42:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 11059 transitions. [2023-11-26 10:42:51,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8681896687078035 [2023-11-26 10:42:51,480 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 11059 transitions. [2023-11-26 10:42:51,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 11059 transitions. [2023-11-26 10:42:51,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:51,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 11059 transitions. [2023-11-26 10:42:51,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 167.56060606060606) internal successors, (11059), 66 states have internal predecessors, (11059), 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) [2023-11-26 10:42:51,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 193.0) internal successors, (12931), 67 states have internal predecessors, (12931), 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) [2023-11-26 10:42:51,532 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 193.0) internal successors, (12931), 67 states have internal predecessors, (12931), 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) [2023-11-26 10:42:51,532 INFO L175 Difference]: Start difference. First operand has 247 places, 211 transitions, 856 flow. Second operand 66 states and 11059 transitions. [2023-11-26 10:42:51,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 635 transitions, 4550 flow [2023-11-26 10:42:51,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 635 transitions, 4480 flow, removed 17 selfloop flow, removed 18 redundant places. [2023-11-26 10:42:51,563 INFO L231 Difference]: Finished difference. Result has 302 places, 233 transitions, 1166 flow [2023-11-26 10:42:51,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=1166, PETRI_PLACES=302, PETRI_TRANSITIONS=233} [2023-11-26 10:42:51,564 INFO L281 CegarLoopForPetriNet]: 189 programPoint places, 113 predicate places. [2023-11-26 10:42:51,564 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 233 transitions, 1166 flow [2023-11-26 10:42:51,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 166.12765957446808) internal successors, (7808), 47 states have internal predecessors, (7808), 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) [2023-11-26 10:42:51,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:51,567 INFO L208 CegarLoopForPetriNet]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:51,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-26 10:42:51,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-26 10:42:51,774 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2023-11-26 10:42:51,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash 552362526, now seen corresponding path program 5 times [2023-11-26 10:42:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698470390] [2023-11-26 10:42:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:42:51,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:42:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:42:52,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:42:52,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:42:52,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2023-11-26 10:42:52,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2023-11-26 10:42:52,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2023-11-26 10:42:52,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2023-11-26 10:42:52,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2023-11-26 10:42:52,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2023-11-26 10:42:52,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2023-11-26 10:42:52,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2023-11-26 10:42:52,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:42:52,485 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:52,499 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:42:52,499 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:42:52,893 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-26 10:42:52,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-26 10:42:52,926 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-26 10:42:52,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:42:52 BasicIcfg [2023-11-26 10:42:52,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:42:52,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:42:52,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:42:52,964 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:42:52,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:28" (3/4) ... [2023-11-26 10:42:52,966 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:42:52,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:42:52,968 INFO L158 Benchmark]: Toolchain (without parser) took 26125.97ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 142.0MB in the beginning and 315.9MB in the end (delta: -173.9MB). Peak memory consumption was 237.3MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,968 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 188.7MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:42:52,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.26ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 121.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.34ms. Allocated memory is still 188.7MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,969 INFO L158 Benchmark]: Boogie Preprocessor took 51.84ms. Allocated memory is still 188.7MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,969 INFO L158 Benchmark]: RCFGBuilder took 647.07ms. Allocated memory is still 188.7MB. Free memory was 117.7MB in the beginning and 95.4MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,970 INFO L158 Benchmark]: TraceAbstraction took 24630.38ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 156.8MB in the beginning and 315.9MB in the end (delta: -159.1MB). Peak memory consumption was 400.8MB. Max. memory is 16.1GB. [2023-11-26 10:42:52,970 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 597.7MB. Free memory is still 315.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:42:52,973 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 188.7MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.26ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 121.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.34ms. Allocated memory is still 188.7MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.84ms. Allocated memory is still 188.7MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.07ms. Allocated memory is still 188.7MB. Free memory was 117.7MB in the beginning and 95.4MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24630.38ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 156.8MB in the beginning and 315.9MB in the end (delta: -159.1MB). Peak memory consumption was 400.8MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 597.7MB. Free memory is still 315.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected [2023-11-26 10:42:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-26 10:42:53,206 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-26 10:42:53,214 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-26 10:42:53,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-26 10:42:53,457 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-26 10:42:53,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=28716, argc=28716, argv={28714:28661}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=28716, argc=28716, argv={28714:28661}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=28716, argc=28716, argv={28714:28661}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=28716, arg={0:0}, argc=28716, argv={28714:28661}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=28716, arg={0:0}, arg={0:0}, argc=28716, argv={28714:28661}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 22 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND FALSE 0 !(x < 22) VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L711] 0 return prev; VAL [\result=17711, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=28716, arg={0:0}, arg={0:0}, argc=28716, argv={28714:28661}, correct=17711, cur=28657, i=1, id1={5:0}, id2={3:0}, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L725] 0 i <= correct VAL [\old(argc)=28716, arg={0:0}, arg={0:0}, argc=28716, argv={28714:28661}, correct=17711, cur=28657, i=1, id1={5:0}, id2={3:0}, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] 1 p < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L688] COND TRUE 1 p < 10 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=2, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L725] 0 i <= correct VAL [\old(argc)=28716, arg={0:0}, arg={0:0}, arg={0:0}, argc=28716, argv={28714:28661}, correct=17711, cur=28657, i=2, id1={5:0}, id2={3:0}, j=1, next=28657, p=0, prev=17711, q=0, x=22] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 245 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 24, TraceHistogramMax: 23, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1545 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 93 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2708 GetRequests, 2478 SyntacticMatches, 19 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3233 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=23, InterpolantAutomatonStates: 197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 4351 NumberOfCodeBlocks, 4351 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4653 ConstructedInterpolants, 0 QuantifiedInterpolants, 10497 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2628 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:42:53,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565da0a9-2a8a-4f44-84d4-03f9cd59d508/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE