./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:43:15,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:43:15,435 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:43:15,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:43:15,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:43:15,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:43:15,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:43:15,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:43:15,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:43:15,485 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:43:15,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:43:15,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:43:15,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:43:15,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:43:15,494 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:43:15,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:43:15,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:43:15,497 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:43:15,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:43:15,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:43:15,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:43:15,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:43:15,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:43:15,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:43:15,500 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:43:15,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:43:15,502 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:43:15,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:43:15,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:43:15,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:43:15,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:43:15,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:15,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:43:15,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:43:15,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:43:15,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:43:15,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:43:15,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:43:15,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:43:15,508 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:43:15,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:43:15,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:43:15,509 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_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/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_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ 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 ! call(reach_error())) ) 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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2023-11-23 21:43:15,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:43:15,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:43:15,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:43:15,899 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:43:15,900 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:43:15,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-23 21:43:19,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:43:19,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:43:19,281 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-23 21:43:19,307 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/data/e9c9764a7/7fa7576abfe74c269625aa0567e5b695/FLAG574bd022d [2023-11-23 21:43:19,327 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/data/e9c9764a7/7fa7576abfe74c269625aa0567e5b695 [2023-11-23 21:43:19,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:43:19,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:43:19,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:19,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:43:19,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:43:19,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:19" (1/1) ... [2023-11-23 21:43:19,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422e2c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19, skipping insertion in model container [2023-11-23 21:43:19,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:19" (1/1) ... [2023-11-23 21:43:19,423 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:43:19,622 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2023-11-23 21:43:19,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:19,924 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:43:19,940 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2023-11-23 21:43:20,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:20,087 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:20,087 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:20,096 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:43:20,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20 WrapperNode [2023-11-23 21:43:20,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:20,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:20,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:43:20,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:43:20,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,171 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-11-23 21:43:20,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:20,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:43:20,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:43:20,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:43:20,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,202 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,229 INFO L189 HeapSplitter]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1] [2023-11-23 21:43:20,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:43:20,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:43:20,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:43:20,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:43:20,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (1/1) ... [2023-11-23 21:43:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:20,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:20,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:43:20,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:43:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 21:43:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 21:43:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 21:43:20,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 21:43:20,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:43:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:43:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:43:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:43:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:43:20,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:43:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:43:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:43:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:43:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:43:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:43:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 21:43:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 21:43:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 21:43:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:43:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:43:20,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:43:20,374 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:43:20,545 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:43:20,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:43:20,992 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:43:21,264 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:43:21,264 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:43:21,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:21 BoogieIcfgContainer [2023-11-23 21:43:21,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:43:21,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:43:21,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:43:21,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:43:21,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:19" (1/3) ... [2023-11-23 21:43:21,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb3f698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:21, skipping insertion in model container [2023-11-23 21:43:21,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:20" (2/3) ... [2023-11-23 21:43:21,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb3f698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:21, skipping insertion in model container [2023-11-23 21:43:21,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:21" (3/3) ... [2023-11-23 21:43:21,277 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-11-23 21:43:21,286 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:43:21,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:43:21,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 21:43:21,298 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:43:21,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:43:21,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-23 21:43:21,437 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-23 21:43:21,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:21,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-23 21:43:21,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-23 21:43:21,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-23 21:43:21,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:43:21,465 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;@19389275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:43:21,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-23 21:43:21,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:43:21,474 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-23 21:43:21,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:21,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:21,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:21,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:21,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1062313938, now seen corresponding path program 1 times [2023-11-23 21:43:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:21,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020186736] [2023-11-23 21:43:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:22,168 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-23 21:43:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020186736] [2023-11-23 21:43:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020186736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415494244] [2023-11-23 21:43:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:22,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:22,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2023-11-23 21:43:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-23 21:43:22,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:22,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2023-11-23 21:43:22,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:22,508 INFO L124 PetriNetUnfolderBase]: 400/754 cut-off events. [2023-11-23 21:43:22,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:22,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 754 events. 400/754 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4869 event pairs, 60 based on Foata normal form. 30/767 useless extension candidates. Maximal degree in co-relation 1393. Up to 509 conditions per place. [2023-11-23 21:43:22,520 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 24 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-23 21:43:22,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 153 flow [2023-11-23 21:43:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-23 21:43:22,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-23 21:43:22,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-23 21:43:22,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-23 21:43:22,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:22,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-23 21:43:22,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-23 21:43:22,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-23 21:43:22,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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-23 21:43:22,548 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 88 transitions. [2023-11-23 21:43:22,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 153 flow [2023-11-23 21:43:22,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 21:43:22,554 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-23 21:43:22,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-23 21:43:22,561 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-23 21:43:22,561 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-23 21:43:22,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-23 21:43:22,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:22,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:22,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:43:22,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:22,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash 9276660, now seen corresponding path program 1 times [2023-11-23 21:43:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282625502] [2023-11-23 21:43:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:23,971 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-23 21:43:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282625502] [2023-11-23 21:43:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282625502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246179419] [2023-11-23 21:43:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:23,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:24,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-23 21:43:24,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-23 21:43:24,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:24,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-23 21:43:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:25,587 INFO L124 PetriNetUnfolderBase]: 2505/4406 cut-off events. [2023-11-23 21:43:25,588 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2023-11-23 21:43:25,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8434 conditions, 4406 events. 2505/4406 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 31940 event pairs, 129 based on Foata normal form. 0/4288 useless extension candidates. Maximal degree in co-relation 8424. Up to 1715 conditions per place. [2023-11-23 21:43:25,623 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 41 selfloop transitions, 11 changer transitions 80/143 dead transitions. [2023-11-23 21:43:25,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 143 transitions, 586 flow [2023-11-23 21:43:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 21:43:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-23 21:43:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 303 transitions. [2023-11-23 21:43:25,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.63125 [2023-11-23 21:43:25,628 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 303 transitions. [2023-11-23 21:43:25,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 303 transitions. [2023-11-23 21:43:25,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:25,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 303 transitions. [2023-11-23 21:43:25,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 25.25) internal successors, (303), 12 states have internal predecessors, (303), 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-23 21:43:25,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 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-23 21:43:25,635 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 40.0) internal successors, (520), 13 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-23 21:43:25,635 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 12 states and 303 transitions. [2023-11-23 21:43:25,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 143 transitions, 586 flow [2023-11-23 21:43:25,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 143 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:25,640 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 184 flow [2023-11-23 21:43:25,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=184, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-11-23 21:43:25,642 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-11-23 21:43:25,642 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 184 flow [2023-11-23 21:43:25,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-23 21:43:25,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:25,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:25,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:43:25,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:25,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash 64379141, now seen corresponding path program 1 times [2023-11-23 21:43:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041129190] [2023-11-23 21:43:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:26,450 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-23 21:43:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041129190] [2023-11-23 21:43:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041129190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797172017] [2023-11-23 21:43:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:26,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-23 21:43:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-23 21:43:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-23 21:43:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:27,489 INFO L124 PetriNetUnfolderBase]: 1713/3117 cut-off events. [2023-11-23 21:43:27,490 INFO L125 PetriNetUnfolderBase]: For 4238/4238 co-relation queries the response was YES. [2023-11-23 21:43:27,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9860 conditions, 3117 events. 1713/3117 cut-off events. For 4238/4238 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21945 event pairs, 323 based on Foata normal form. 102/3202 useless extension candidates. Maximal degree in co-relation 9841. Up to 1172 conditions per place. [2023-11-23 21:43:27,522 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 41 selfloop transitions, 10 changer transitions 52/114 dead transitions. [2023-11-23 21:43:27,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 114 transitions, 751 flow [2023-11-23 21:43:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:43:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 21:43:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2023-11-23 21:43:27,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5775 [2023-11-23 21:43:27,525 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 231 transitions. [2023-11-23 21:43:27,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 231 transitions. [2023-11-23 21:43:27,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:27,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 231 transitions. [2023-11-23 21:43:27,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 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-23 21:43:27,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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-23 21:43:27,530 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 40.0) internal successors, (440), 11 states have internal predecessors, (440), 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-23 21:43:27,530 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 184 flow. Second operand 10 states and 231 transitions. [2023-11-23 21:43:27,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 114 transitions, 751 flow [2023-11-23 21:43:27,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 114 transitions, 687 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-11-23 21:43:27,562 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 264 flow [2023-11-23 21:43:27,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-11-23 21:43:27,563 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2023-11-23 21:43:27,563 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 264 flow [2023-11-23 21:43:27,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-23 21:43:27,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:27,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:27,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:43:27,564 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:27,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1564287590, now seen corresponding path program 1 times [2023-11-23 21:43:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:27,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337333203] [2023-11-23 21:43:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:27,821 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-23 21:43:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337333203] [2023-11-23 21:43:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337333203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:27,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:27,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:43:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044771073] [2023-11-23 21:43:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:27,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:43:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:43:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:43:27,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-23 21:43:27,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-23 21:43:27,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:27,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-23 21:43:27,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:28,604 INFO L124 PetriNetUnfolderBase]: 2541/4218 cut-off events. [2023-11-23 21:43:28,604 INFO L125 PetriNetUnfolderBase]: For 8226/8728 co-relation queries the response was YES. [2023-11-23 21:43:28,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13433 conditions, 4218 events. 2541/4218 cut-off events. For 8226/8728 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 26845 event pairs, 346 based on Foata normal form. 250/4311 useless extension candidates. Maximal degree in co-relation 13408. Up to 2142 conditions per place. [2023-11-23 21:43:28,654 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 57 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-23 21:43:28,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 580 flow [2023-11-23 21:43:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:43:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:43:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2023-11-23 21:43:28,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66875 [2023-11-23 21:43:28,656 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 107 transitions. [2023-11-23 21:43:28,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 107 transitions. [2023-11-23 21:43:28,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:28,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 107 transitions. [2023-11-23 21:43:28,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-23 21:43:28,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-23 21:43:28,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-23 21:43:28,658 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 264 flow. Second operand 4 states and 107 transitions. [2023-11-23 21:43:28,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 580 flow [2023-11-23 21:43:28,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 561 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-23 21:43:28,708 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 287 flow [2023-11-23 21:43:28,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-23 21:43:28,709 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-11-23 21:43:28,709 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 287 flow [2023-11-23 21:43:28,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-23 21:43:28,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:28,710 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-23 21:43:28,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:43:28,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:28,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 928828099, now seen corresponding path program 1 times [2023-11-23 21:43:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600117160] [2023-11-23 21:43:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:29,502 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-23 21:43:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600117160] [2023-11-23 21:43:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600117160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:43:29,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249572392] [2023-11-23 21:43:29,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:29,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2023-11-23 21:43:29,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-23 21:43:29,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:29,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2023-11-23 21:43:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:30,659 INFO L124 PetriNetUnfolderBase]: 2718/4813 cut-off events. [2023-11-23 21:43:30,659 INFO L125 PetriNetUnfolderBase]: For 5814/6112 co-relation queries the response was YES. [2023-11-23 21:43:30,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15426 conditions, 4813 events. 2718/4813 cut-off events. For 5814/6112 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 34461 event pairs, 956 based on Foata normal form. 94/4600 useless extension candidates. Maximal degree in co-relation 15400. Up to 1980 conditions per place. [2023-11-23 21:43:30,718 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 52 selfloop transitions, 15 changer transitions 21/103 dead transitions. [2023-11-23 21:43:30,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 717 flow [2023-11-23 21:43:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:43:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:43:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2023-11-23 21:43:30,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.590625 [2023-11-23 21:43:30,722 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 189 transitions. [2023-11-23 21:43:30,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 189 transitions. [2023-11-23 21:43:30,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:30,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 189 transitions. [2023-11-23 21:43:30,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-23 21:43:30,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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-23 21:43:30,725 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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-23 21:43:30,725 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 287 flow. Second operand 8 states and 189 transitions. [2023-11-23 21:43:30,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 717 flow [2023-11-23 21:43:30,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 707 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-23 21:43:30,740 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 373 flow [2023-11-23 21:43:30,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=373, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2023-11-23 21:43:30,743 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2023-11-23 21:43:30,744 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 373 flow [2023-11-23 21:43:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-23 21:43:30,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:30,744 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-23 21:43:30,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:43:30,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:30,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash 612578457, now seen corresponding path program 1 times [2023-11-23 21:43:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127400491] [2023-11-23 21:43:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:31,090 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-23 21:43:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127400491] [2023-11-23 21:43:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127400491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:43:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439805259] [2023-11-23 21:43:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:31,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:43:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:43:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:43:31,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-23 21:43:31,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-23 21:43:31,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:31,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-23 21:43:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:31,903 INFO L124 PetriNetUnfolderBase]: 2318/3935 cut-off events. [2023-11-23 21:43:31,903 INFO L125 PetriNetUnfolderBase]: For 7269/7912 co-relation queries the response was YES. [2023-11-23 21:43:31,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13087 conditions, 3935 events. 2318/3935 cut-off events. For 7269/7912 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 25126 event pairs, 218 based on Foata normal form. 283/4132 useless extension candidates. Maximal degree in co-relation 13058. Up to 1393 conditions per place. [2023-11-23 21:43:31,937 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 61 selfloop transitions, 8 changer transitions 9/97 dead transitions. [2023-11-23 21:43:31,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 758 flow [2023-11-23 21:43:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:43:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:43:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2023-11-23 21:43:31,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-11-23 21:43:31,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2023-11-23 21:43:31,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2023-11-23 21:43:31,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:31,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2023-11-23 21:43:31,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-23 21:43:31,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-23 21:43:31,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 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-23 21:43:31,943 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 373 flow. Second operand 5 states and 136 transitions. [2023-11-23 21:43:31,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 758 flow [2023-11-23 21:43:31,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 736 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:31,967 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 360 flow [2023-11-23 21:43:31,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-11-23 21:43:31,971 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-11-23 21:43:31,971 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 360 flow [2023-11-23 21:43:31,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-23 21:43:31,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:31,972 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] [2023-11-23 21:43:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:43:31,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:31,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1351469100, now seen corresponding path program 1 times [2023-11-23 21:43:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834078757] [2023-11-23 21:43:31,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:31,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:32,425 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-23 21:43:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834078757] [2023-11-23 21:43:32,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834078757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:32,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:32,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855682473] [2023-11-23 21:43:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:32,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:32,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-23 21:43:32,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-23 21:43:32,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:32,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-23 21:43:32,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:33,004 INFO L124 PetriNetUnfolderBase]: 1698/2907 cut-off events. [2023-11-23 21:43:33,005 INFO L125 PetriNetUnfolderBase]: For 8313/9193 co-relation queries the response was YES. [2023-11-23 21:43:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10839 conditions, 2907 events. 1698/2907 cut-off events. For 8313/9193 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18191 event pairs, 178 based on Foata normal form. 215/3043 useless extension candidates. Maximal degree in co-relation 10807. Up to 1176 conditions per place. [2023-11-23 21:43:33,024 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 53 selfloop transitions, 11 changer transitions 7/88 dead transitions. [2023-11-23 21:43:33,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 670 flow [2023-11-23 21:43:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-23 21:43:33,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2023-11-23 21:43:33,026 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-23 21:43:33,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-23 21:43:33,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:33,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-23 21:43:33,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-23 21:43:33,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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-23 21:43:33,028 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 40.0) internal successors, (280), 7 states have internal predecessors, (280), 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-23 21:43:33,028 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 360 flow. Second operand 6 states and 149 transitions. [2023-11-23 21:43:33,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 670 flow [2023-11-23 21:43:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 635 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-23 21:43:33,040 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 336 flow [2023-11-23 21:43:33,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-11-23 21:43:33,042 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2023-11-23 21:43:33,042 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 336 flow [2023-11-23 21:43:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-23 21:43:33,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:33,043 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] [2023-11-23 21:43:33,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:43:33,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:33,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash -807564064, now seen corresponding path program 1 times [2023-11-23 21:43:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899528294] [2023-11-23 21:43:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:34,140 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-23 21:43:34,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:34,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899528294] [2023-11-23 21:43:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899528294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:34,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:43:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816996679] [2023-11-23 21:43:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:34,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:43:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:43:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:43:34,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-23 21:43:34,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 336 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-23 21:43:34,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:34,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-23 21:43:34,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:34,850 INFO L124 PetriNetUnfolderBase]: 931/1854 cut-off events. [2023-11-23 21:43:34,851 INFO L125 PetriNetUnfolderBase]: For 4148/4715 co-relation queries the response was YES. [2023-11-23 21:43:34,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6328 conditions, 1854 events. 931/1854 cut-off events. For 4148/4715 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12354 event pairs, 155 based on Foata normal form. 39/1717 useless extension candidates. Maximal degree in co-relation 6299. Up to 731 conditions per place. [2023-11-23 21:43:34,866 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 26 selfloop transitions, 6 changer transitions 42/93 dead transitions. [2023-11-23 21:43:34,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 669 flow [2023-11-23 21:43:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:43:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:43:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2023-11-23 21:43:34,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2023-11-23 21:43:34,869 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 172 transitions. [2023-11-23 21:43:34,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 172 transitions. [2023-11-23 21:43:34,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:34,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 172 transitions. [2023-11-23 21:43:34,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 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-23 21:43:34,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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-23 21:43:34,872 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 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-23 21:43:34,872 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 336 flow. Second operand 8 states and 172 transitions. [2023-11-23 21:43:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 669 flow [2023-11-23 21:43:34,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 584 flow, removed 32 selfloop flow, removed 6 redundant places. [2023-11-23 21:43:34,894 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 247 flow [2023-11-23 21:43:34,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=247, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2023-11-23 21:43:34,896 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-11-23 21:43:34,897 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 247 flow [2023-11-23 21:43:34,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-23 21:43:34,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:34,897 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] [2023-11-23 21:43:34,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:43:34,898 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:34,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1880435288, now seen corresponding path program 2 times [2023-11-23 21:43:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:34,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917438687] [2023-11-23 21:43:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:34,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:37,299 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-23 21:43:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917438687] [2023-11-23 21:43:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917438687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 21:43:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041458051] [2023-11-23 21:43:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:37,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 21:43:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 21:43:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:43:37,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2023-11-23 21:43:37,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 44 transitions, 247 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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-23 21:43:37,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:37,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2023-11-23 21:43:37,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:38,098 INFO L124 PetriNetUnfolderBase]: 508/1035 cut-off events. [2023-11-23 21:43:38,098 INFO L125 PetriNetUnfolderBase]: For 1581/1722 co-relation queries the response was YES. [2023-11-23 21:43:38,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 1035 events. 508/1035 cut-off events. For 1581/1722 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6162 event pairs, 108 based on Foata normal form. 23/956 useless extension candidates. Maximal degree in co-relation 2978. Up to 367 conditions per place. [2023-11-23 21:43:38,106 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 24 selfloop transitions, 7 changer transitions 24/74 dead transitions. [2023-11-23 21:43:38,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 74 transitions, 463 flow [2023-11-23 21:43:38,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 21:43:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-23 21:43:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2023-11-23 21:43:38,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-11-23 21:43:38,108 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 198 transitions. [2023-11-23 21:43:38,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 198 transitions. [2023-11-23 21:43:38,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:38,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 198 transitions. [2023-11-23 21:43:38,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 18.0) internal successors, (198), 11 states have internal predecessors, (198), 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-23 21:43:38,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 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-23 21:43:38,112 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 40.0) internal successors, (480), 12 states have internal predecessors, (480), 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-23 21:43:38,112 INFO L175 Difference]: Start difference. First operand has 75 places, 44 transitions, 247 flow. Second operand 11 states and 198 transitions. [2023-11-23 21:43:38,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 74 transitions, 463 flow [2023-11-23 21:43:38,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 407 flow, removed 6 selfloop flow, removed 13 redundant places. [2023-11-23 21:43:38,121 INFO L231 Difference]: Finished difference. Result has 72 places, 42 transitions, 216 flow [2023-11-23 21:43:38,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=216, PETRI_PLACES=72, PETRI_TRANSITIONS=42} [2023-11-23 21:43:38,122 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-11-23 21:43:38,123 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 216 flow [2023-11-23 21:43:38,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 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-23 21:43:38,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:38,123 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] [2023-11-23 21:43:38,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:43:38,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-23 21:43:38,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 411083774, now seen corresponding path program 3 times [2023-11-23 21:43:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85514437] [2023-11-23 21:43:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:43:38,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:43:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:43:38,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:43:38,304 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:43:38,306 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-23 21:43:38,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-23 21:43:38,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-23 21:43:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-23 21:43:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-23 21:43:38,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-23 21:43:38,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:43:38,317 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:38,323 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:43:38,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:43:38,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:43:38,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:43:38,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:43:38,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:43:38 BasicIcfg [2023-11-23 21:43:38,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:43:38,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:43:38,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:43:38,443 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:43:38,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:21" (3/4) ... [2023-11-23 21:43:38,445 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 21:43:38,472 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:43:38,473 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:43:38,473 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:43:38,561 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 21:43:38,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:43:38,562 INFO L158 Benchmark]: Toolchain (without parser) took 19226.67ms. Allocated memory was 140.5MB in the beginning and 658.5MB in the end (delta: 518.0MB). Free memory was 93.2MB in the beginning and 381.2MB in the end (delta: -288.1MB). Peak memory consumption was 232.8MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,563 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 140.5MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:43:38,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.83ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 68.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.20ms. Allocated memory is still 140.5MB. Free memory was 68.1MB in the beginning and 65.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,564 INFO L158 Benchmark]: Boogie Preprocessor took 93.64ms. Allocated memory is still 140.5MB. Free memory was 65.1MB in the beginning and 61.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,564 INFO L158 Benchmark]: RCFGBuilder took 997.73ms. Allocated memory is still 140.5MB. Free memory was 60.9MB in the beginning and 74.4MB in the end (delta: -13.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,564 INFO L158 Benchmark]: TraceAbstraction took 17173.44ms. Allocated memory was 140.5MB in the beginning and 658.5MB in the end (delta: 518.0MB). Free memory was 73.5MB in the beginning and 393.8MB in the end (delta: -320.3MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,565 INFO L158 Benchmark]: Witness Printer took 118.80ms. Allocated memory is still 658.5MB. Free memory was 393.8MB in the beginning and 381.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 21:43:38,567 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 140.5MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 760.83ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 68.1MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.20ms. Allocated memory is still 140.5MB. Free memory was 68.1MB in the beginning and 65.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.64ms. Allocated memory is still 140.5MB. Free memory was 65.1MB in the beginning and 61.5MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.73ms. Allocated memory is still 140.5MB. Free memory was 60.9MB in the beginning and 74.4MB in the end (delta: -13.5MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17173.44ms. Allocated memory was 140.5MB in the beginning and 658.5MB in the end (delta: 518.0MB). Free memory was 73.5MB in the beginning and 393.8MB in the end (delta: -320.3MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. * Witness Printer took 118.80ms. Allocated memory is still 658.5MB. Free memory was 393.8MB in the beginning and 381.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 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: 16.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1177 IncrementalHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 68 mSDtfsCounter, 1177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=5, InterpolantAutomatonStates: 67, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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-23 21:43:38,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef8f59a4-f9ac-4f99-81e7-d09555de4d2a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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