./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya --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 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:08:28,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:08:28,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:08:28,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:08:28,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:08:28,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:08:28,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:08:28,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:08:28,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:08:28,887 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:08:28,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:08:28,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:08:28,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:08:28,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:08:28,890 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:08:28,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:08:28,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:08:28,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:08:28,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:08:28,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:08:28,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:08:28,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:08:28,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:08:28,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:08:28,895 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:08:28,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:08:28,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:08:28,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:08:28,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:08:28,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:08:28,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:08:28,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:08:28,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:08:28,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:08:28,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:08:28,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:08:28,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:08:28,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:08:28,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:08:28,900 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:08:28,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:08:28,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:08:28,901 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_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/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_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b [2023-11-29 03:08:29,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:08:29,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:08:29,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:08:29,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:08:29,143 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:08:29,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-29 03:08:31,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:08:32,086 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:08:32,087 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/sv-benchmarks/c/pthread-wmm/mix016.oepc.i [2023-11-29 03:08:32,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/data/023fd607a/84dab5141f244dc198e91430c2708497/FLAGa40e2d93d [2023-11-29 03:08:32,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/data/023fd607a/84dab5141f244dc198e91430c2708497 [2023-11-29 03:08:32,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:08:32,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:08:32,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:32,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:08:32,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:08:32,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6a04d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32, skipping insertion in model container [2023-11-29 03:08:32,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,184 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:08:32,351 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_e53d4029-6be6-4236-843b-e399ea7b8076/sv-benchmarks/c/pthread-wmm/mix016.oepc.i[945,958] [2023-11-29 03:08:32,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:32,550 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:08:32,562 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_e53d4029-6be6-4236-843b-e399ea7b8076/sv-benchmarks/c/pthread-wmm/mix016.oepc.i[945,958] [2023-11-29 03:08:32,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:08:32,640 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:32,640 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:08:32,648 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:08:32,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32 WrapperNode [2023-11-29 03:08:32,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:08:32,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:32,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:08:32,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:08:32,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,700 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-11-29 03:08:32,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:08:32,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:08:32,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:08:32,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:08:32,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,735 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 03:08:32,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:08:32,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:08:32,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:08:32,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:08:32,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (1/1) ... [2023-11-29 03:08:32,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:08:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:08:32,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:08:32,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:08:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:08:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:08:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:08:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:08:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 03:08:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:08:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:08:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:08:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 03:08:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 03:08:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 03:08:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 03:08:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 03:08:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 03:08:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:08:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:08:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:08:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:08:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 03:08:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:08:32,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:08:32,832 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 03:08:32,961 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:08:32,963 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:08:33,227 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:08:33,418 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:08:33,419 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 03:08:33,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:33 BoogieIcfgContainer [2023-11-29 03:08:33,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:08:33,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:08:33,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:08:33,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:08:33,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:08:32" (1/3) ... [2023-11-29 03:08:33,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130f6bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:33, skipping insertion in model container [2023-11-29 03:08:33,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:08:32" (2/3) ... [2023-11-29 03:08:33,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130f6bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:08:33, skipping insertion in model container [2023-11-29 03:08:33,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:33" (3/3) ... [2023-11-29 03:08:33,428 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016.oepc.i [2023-11-29 03:08:33,437 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 03:08:33,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:08:33,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 03:08:33,448 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 03:08:33,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 03:08:33,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 03:08:33,553 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-29 03:08:33,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:08:33,558 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 4. Compared 68 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-29 03:08:33,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-29 03:08:33,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-29 03:08:33,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:08:33,580 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;@41cbc160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:08:33,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 03:08:33,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:08:33,585 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-29 03:08:33,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:08:33,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:33,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 03:08:33,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:33,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 11354589, now seen corresponding path program 1 times [2023-11-29 03:08:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:33,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832020403] [2023-11-29 03:08:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:33,954 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-29 03:08:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832020403] [2023-11-29 03:08:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832020403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:08:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640258087] [2023-11-29 03:08:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:33,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:08:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:08:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:08:33,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2023-11-29 03:08:34,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-29 03:08:34,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:34,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2023-11-29 03:08:34,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:34,360 INFO L124 PetriNetUnfolderBase]: 617/1134 cut-off events. [2023-11-29 03:08:34,360 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 03:08:34,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1134 events. 617/1134 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6702 event pairs, 199 based on Foata normal form. 45/1158 useless extension candidates. Maximal degree in co-relation 2100. Up to 763 conditions per place. [2023-11-29 03:08:34,375 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 29 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-29 03:08:34,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 179 flow [2023-11-29 03:08:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:08:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:08:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-29 03:08:34,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.775 [2023-11-29 03:08:34,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-29 03:08:34,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-29 03:08:34,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:34,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-29 03:08:34,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-29 03:08:34,398 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-29 03:08:34,398 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-29 03:08:34,400 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 93 transitions. [2023-11-29 03:08:34,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 179 flow [2023-11-29 03:08:34,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 03:08:34,406 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2023-11-29 03:08:34,408 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-29 03:08:34,412 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-29 03:08:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2023-11-29 03:08:34,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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-29 03:08:34,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:34,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:08:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:08:34,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:34,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 66218276, now seen corresponding path program 1 times [2023-11-29 03:08:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006998680] [2023-11-29 03:08:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:34,645 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-29 03:08:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006998680] [2023-11-29 03:08:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006998680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:08:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961364578] [2023-11-29 03:08:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:34,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:08:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:08:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:08:34,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:08:34,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-29 03:08:34,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:34,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:08:34,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:35,157 INFO L124 PetriNetUnfolderBase]: 1318/2354 cut-off events. [2023-11-29 03:08:35,157 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-11-29 03:08:35,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4533 conditions, 2354 events. 1318/2354 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15121 event pairs, 188 based on Foata normal form. 100/2327 useless extension candidates. Maximal degree in co-relation 4523. Up to 1053 conditions per place. [2023-11-29 03:08:35,178 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2023-11-29 03:08:35,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 230 flow [2023-11-29 03:08:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:08:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 03:08:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2023-11-29 03:08:35,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68125 [2023-11-29 03:08:35,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 109 transitions. [2023-11-29 03:08:35,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 109 transitions. [2023-11-29 03:08:35,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:35,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 109 transitions. [2023-11-29 03:08:35,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-29 03:08:35,184 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-29 03:08:35,184 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-29 03:08:35,184 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 4 states and 109 transitions. [2023-11-29 03:08:35,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 230 flow [2023-11-29 03:08:35,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:08:35,187 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 108 flow [2023-11-29 03:08:35,187 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-11-29 03:08:35,188 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-29 03:08:35,188 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 108 flow [2023-11-29 03:08:35,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-29 03:08:35,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:35,189 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-29 03:08:35,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:08:35,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:35,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1785469340, now seen corresponding path program 1 times [2023-11-29 03:08:35,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410948123] [2023-11-29 03:08:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:35,411 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-29 03:08:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410948123] [2023-11-29 03:08:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410948123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:35,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:08:35,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470457963] [2023-11-29 03:08:35,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:08:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:08:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:08:35,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:08:35,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-29 03:08:35,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:35,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:08:35,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:35,793 INFO L124 PetriNetUnfolderBase]: 886/1568 cut-off events. [2023-11-29 03:08:35,793 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2023-11-29 03:08:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3545 conditions, 1568 events. 886/1568 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8723 event pairs, 100 based on Foata normal form. 82/1572 useless extension candidates. Maximal degree in co-relation 3533. Up to 465 conditions per place. [2023-11-29 03:08:35,804 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 52 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2023-11-29 03:08:35,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 323 flow [2023-11-29 03:08:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:08:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 03:08:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2023-11-29 03:08:35,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.69 [2023-11-29 03:08:35,807 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 138 transitions. [2023-11-29 03:08:35,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 138 transitions. [2023-11-29 03:08:35,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:35,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 138 transitions. [2023-11-29 03:08:35,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 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-29 03:08:35,809 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-29 03:08:35,810 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-29 03:08:35,810 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 108 flow. Second operand 5 states and 138 transitions. [2023-11-29 03:08:35,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 323 flow [2023-11-29 03:08:35,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 03:08:35,813 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 148 flow [2023-11-29 03:08:35,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-29 03:08:35,814 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-11-29 03:08:35,814 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 148 flow [2023-11-29 03:08:35,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-29 03:08:35,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:35,815 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] [2023-11-29 03:08:35,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:08:35,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:35,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -222251869, now seen corresponding path program 1 times [2023-11-29 03:08:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842594668] [2023-11-29 03:08:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:36,060 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-29 03:08:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842594668] [2023-11-29 03:08:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842594668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:08:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237725624] [2023-11-29 03:08:36,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:08:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:08:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:08:36,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2023-11-29 03:08:36,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-29 03:08:36,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:36,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2023-11-29 03:08:36,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:36,355 INFO L124 PetriNetUnfolderBase]: 557/941 cut-off events. [2023-11-29 03:08:36,355 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2023-11-29 03:08:36,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 941 events. 557/941 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4330 event pairs, 83 based on Foata normal form. 40/937 useless extension candidates. Maximal degree in co-relation 2421. Up to 308 conditions per place. [2023-11-29 03:08:36,363 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2023-11-29 03:08:36,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 330 flow [2023-11-29 03:08:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:08:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 03:08:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-29 03:08:36,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2023-11-29 03:08:36,365 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-29 03:08:36,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-29 03:08:36,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:36,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-29 03:08:36,366 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-29 03:08:36,368 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-29 03:08:36,368 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-29 03:08:36,368 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 148 flow. Second operand 6 states and 149 transitions. [2023-11-29 03:08:36,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 330 flow [2023-11-29 03:08:36,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 03:08:36,375 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2023-11-29 03:08:36,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-11-29 03:08:36,376 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-11-29 03:08:36,377 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2023-11-29 03:08:36,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-29 03:08:36,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:36,377 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-29 03:08:36,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:08:36,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:36,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1735290960, now seen corresponding path program 1 times [2023-11-29 03:08:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352264539] [2023-11-29 03:08:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:37,441 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-29 03:08:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352264539] [2023-11-29 03:08:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352264539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:08:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721503117] [2023-11-29 03:08:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:37,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:08:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:08:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:08:37,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2023-11-29 03:08:37,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-29 03:08:37,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:37,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2023-11-29 03:08:37,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:37,892 INFO L124 PetriNetUnfolderBase]: 470/911 cut-off events. [2023-11-29 03:08:37,893 INFO L125 PetriNetUnfolderBase]: For 539/559 co-relation queries the response was YES. [2023-11-29 03:08:37,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 911 events. 470/911 cut-off events. For 539/559 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4594 event pairs, 146 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 2216. Up to 430 conditions per place. [2023-11-29 03:08:37,898 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 27 selfloop transitions, 6 changer transitions 29/82 dead transitions. [2023-11-29 03:08:37,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 388 flow [2023-11-29 03:08:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:08:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 03:08:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2023-11-29 03:08:37,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-29 03:08:37,900 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 216 transitions. [2023-11-29 03:08:37,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 216 transitions. [2023-11-29 03:08:37,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:37,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 216 transitions. [2023-11-29 03:08:37,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.0) internal successors, (216), 9 states have internal predecessors, (216), 0 states have call successors, (0), 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-29 03:08:37,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 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-29 03:08:37,904 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 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-29 03:08:37,904 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 9 states and 216 transitions. [2023-11-29 03:08:37,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 388 flow [2023-11-29 03:08:37,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 324 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 03:08:37,910 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 151 flow [2023-11-29 03:08:37,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-11-29 03:08:37,911 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-11-29 03:08:37,911 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 151 flow [2023-11-29 03:08:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-29 03:08:37,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:37,911 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-29 03:08:37,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:08:37,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:37,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 173875186, now seen corresponding path program 2 times [2023-11-29 03:08:37,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:37,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395811830] [2023-11-29 03:08:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:37,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:08:38,699 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-29 03:08:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:08:38,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395811830] [2023-11-29 03:08:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395811830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:08:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:08:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:08:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962778550] [2023-11-29 03:08:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:08:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:08:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:08:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:08:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:08:38,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2023-11-29 03:08:38,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 151 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-29 03:08:38,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:08:38,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2023-11-29 03:08:38,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:08:39,183 INFO L124 PetriNetUnfolderBase]: 580/1124 cut-off events. [2023-11-29 03:08:39,184 INFO L125 PetriNetUnfolderBase]: For 190/210 co-relation queries the response was YES. [2023-11-29 03:08:39,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1124 events. 580/1124 cut-off events. For 190/210 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6108 event pairs, 136 based on Foata normal form. 12/1098 useless extension candidates. Maximal degree in co-relation 2487. Up to 446 conditions per place. [2023-11-29 03:08:39,193 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 40 selfloop transitions, 7 changer transitions 21/88 dead transitions. [2023-11-29 03:08:39,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 399 flow [2023-11-29 03:08:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:08:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 03:08:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2023-11-29 03:08:39,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2023-11-29 03:08:39,195 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 220 transitions. [2023-11-29 03:08:39,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 220 transitions. [2023-11-29 03:08:39,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:08:39,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 220 transitions. [2023-11-29 03:08:39,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 0 states have call successors, (0), 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-29 03:08:39,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 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-29 03:08:39,198 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 40.0) internal successors, (400), 10 states have internal predecessors, (400), 0 states have call successors, (0), 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-29 03:08:39,198 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 151 flow. Second operand 9 states and 220 transitions. [2023-11-29 03:08:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 399 flow [2023-11-29 03:08:39,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 383 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 03:08:39,202 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 188 flow [2023-11-29 03:08:39,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-11-29 03:08:39,203 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2023-11-29 03:08:39,203 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 188 flow [2023-11-29 03:08:39,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-29 03:08:39,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:08:39,204 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-29 03:08:39,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:08:39,204 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 03:08:39,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:08:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1555172796, now seen corresponding path program 3 times [2023-11-29 03:08:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:08:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056030277] [2023-11-29 03:08:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:08:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:08:39,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:08:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:08:39,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:08:39,362 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:08:39,363 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 03:08:39,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 03:08:39,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 03:08:39,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 03:08:39,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 03:08:39,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 03:08:39,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:08:39,367 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-29 03:08:39,373 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 03:08:39,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:08:39,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:08:39,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:08:39,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 03:08:39,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:08:39 BasicIcfg [2023-11-29 03:08:39,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:08:39,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:08:39,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:08:39,452 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:08:39,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:08:33" (3/4) ... [2023-11-29 03:08:39,454 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 03:08:39,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 03:08:39,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 03:08:39,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 03:08:39,546 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:08:39,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:08:39,547 INFO L158 Benchmark]: Toolchain (without parser) took 7423.67ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 128.2MB in the beginning and 159.4MB in the end (delta: -31.2MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,548 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 88.3MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:08:39,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.23ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 104.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 101.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,549 INFO L158 Benchmark]: Boogie Preprocessor took 56.68ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 98.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,549 INFO L158 Benchmark]: RCFGBuilder took 660.74ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 128.6MB in the end (delta: -30.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,549 INFO L158 Benchmark]: TraceAbstraction took 6029.63ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 127.6MB in the beginning and 173.0MB in the end (delta: -45.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,550 INFO L158 Benchmark]: Witness Printer took 94.55ms. Allocated memory is still 243.3MB. Free memory was 172.0MB in the beginning and 159.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:08:39,552 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.18ms. Allocated memory is still 119.5MB. Free memory was 88.3MB in the beginning and 88.3MB in the end (delta: 25.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.23ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 104.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 101.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.68ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 98.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.74ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 128.6MB in the end (delta: -30.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6029.63ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 127.6MB in the beginning and 173.0MB in the end (delta: -45.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Witness Printer took 94.55ms. Allocated memory is still 243.3MB. Free memory was 172.0MB in the beginning and 159.4MB 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t409; [L841] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t410; [L843] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 0 pthread_t t411; [L845] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L807] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L808] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L809] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L810] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L812] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EBX = z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409={5:0}, t410={6:0}, t411={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 843]: 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: 845]: 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: 841]: 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: 5.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 965 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 7 mSDtfsCounter, 965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=6, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-29 03:08:39,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e53d4029-6be6-4236-843b-e399ea7b8076/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE