./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/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_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/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_54826671-f563-42ad-b715-fdc585801768/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 e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:00:20,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:00:20,284 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:00:20,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:00:20,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:00:20,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:00:20,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:00:20,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:00:20,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:00:20,316 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:00:20,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:00:20,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:00:20,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:00:20,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:00:20,318 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:00:20,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:00:20,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:00:20,320 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:00:20,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:00:20,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:00:20,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:00:20,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:00:20,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:00:20,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:00:20,323 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:00:20,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:00:20,324 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:00:20,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:00:20,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:00:20,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:00:20,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:00:20,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:00:20,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:00:20,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:00:20,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:00:20,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:00:20,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:00:20,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:00:20,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:00:20,328 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:00:20,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:00:20,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:00:20,329 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_54826671-f563-42ad-b715-fdc585801768/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_54826671-f563-42ad-b715-fdc585801768/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 -> e872da92455c9ab0fe125378ae9802f1d4dfc806cea229583fb74f8b758e929f [2023-11-29 02:00:20,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:00:20,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:00:20,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:00:20,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:00:20,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:00:20,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2023-11-29 02:00:23,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:00:23,592 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:00:23,593 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i [2023-11-29 02:00:23,616 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/data/caa4d8e3b/2b63b58402a9469ea73fd81a2192b650/FLAG6628bdb03 [2023-11-29 02:00:23,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/data/caa4d8e3b/2b63b58402a9469ea73fd81a2192b650 [2023-11-29 02:00:23,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:00:23,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:00:23,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:23,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:00:23,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:00:23,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:23" (1/1) ... [2023-11-29 02:00:23,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a131a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:23, skipping insertion in model container [2023-11-29 02:00:23,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:23" (1/1) ... [2023-11-29 02:00:23,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:00:23,865 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_54826671-f563-42ad-b715-fdc585801768/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2023-11-29 02:00:24,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:24,115 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:00:24,127 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_54826671-f563-42ad-b715-fdc585801768/sv-benchmarks/c/pthread-wmm/safe000_power.oepc.i[995,1008] [2023-11-29 02:00:24,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:24,213 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:00:24,214 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:00:24,221 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:00:24,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24 WrapperNode [2023-11-29 02:00:24,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:24,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:24,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:00:24,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:00:24,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,277 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-11-29 02:00:24,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:24,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:00:24,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:00:24,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:00:24,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,317 INFO L175 MemorySlicer]: Split 35 memory accesses to 5 slices as follows [2, 1, 30, 1, 1]. 86 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 14 writes are split as follows [0, 1, 11, 1, 1]. [2023-11-29 02:00:24,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:00:24,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:00:24,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:00:24,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:00:24,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (1/1) ... [2023-11-29 02:00:24,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:00:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:00:24,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:00:24,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:00:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:00:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:00:24,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 02:00:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 02:00:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 02:00:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:00:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:00:24,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:00:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:00:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:00:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:00:24,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:00:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:00:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:00:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:00:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:00:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:00:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:00:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:00:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:00:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:00:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:00:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:00:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:00:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:00:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:00:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:00:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:00:24,415 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 02:00:24,580 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:00:24,583 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:00:25,011 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:00:25,373 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:00:25,374 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:00:25,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:25 BoogieIcfgContainer [2023-11-29 02:00:25,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:00:25,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:00:25,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:00:25,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:00:25,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:00:23" (1/3) ... [2023-11-29 02:00:25,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5367130d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:25, skipping insertion in model container [2023-11-29 02:00:25,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:24" (2/3) ... [2023-11-29 02:00:25,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5367130d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:25, skipping insertion in model container [2023-11-29 02:00:25,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:25" (3/3) ... [2023-11-29 02:00:25,381 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2023-11-29 02:00:25,389 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:00:25,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:00:25,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:00:25,400 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:00:25,490 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:00:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2023-11-29 02:00:25,544 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-11-29 02:00:25,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:00:25,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-11-29 02:00:25,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2023-11-29 02:00:25,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2023-11-29 02:00:25,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:00:25,566 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;@57bf8cb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:00:25,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 02:00:25,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:00:25,579 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-11-29 02:00:25,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:00:25,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:25,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:25,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:25,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1371394576, now seen corresponding path program 1 times [2023-11-29 02:00:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:25,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342406197] [2023-11-29 02:00:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:26,148 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 02:00:26,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342406197] [2023-11-29 02:00:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342406197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850491389] [2023-11-29 02:00:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:26,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:26,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:26,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2023-11-29 02:00:26,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 02:00:26,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:26,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2023-11-29 02:00:26,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:27,214 INFO L124 PetriNetUnfolderBase]: 1333/2181 cut-off events. [2023-11-29 02:00:27,214 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 02:00:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 2181 events. 1333/2181 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13576 event pairs, 217 based on Foata normal form. 75/2250 useless extension candidates. Maximal degree in co-relation 4213. Up to 1416 conditions per place. [2023-11-29 02:00:27,236 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 31 selfloop transitions, 2 changer transitions 35/78 dead transitions. [2023-11-29 02:00:27,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 304 flow [2023-11-29 02:00:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:00:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:00:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2023-11-29 02:00:27,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2023-11-29 02:00:27,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 161 transitions. [2023-11-29 02:00:27,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 161 transitions. [2023-11-29 02:00:27,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:27,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 161 transitions. [2023-11-29 02:00:27,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 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 02:00:27,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:27,262 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:27,264 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 161 transitions. [2023-11-29 02:00:27,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 304 flow [2023-11-29 02:00:27,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 02:00:27,271 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 86 flow [2023-11-29 02:00:27,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2023-11-29 02:00:27,276 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-29 02:00:27,277 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 86 flow [2023-11-29 02:00:27,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 02:00:27,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:27,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:27,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:00:27,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:27,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:27,279 INFO L85 PathProgramCache]: Analyzing trace with hash 88400337, now seen corresponding path program 1 times [2023-11-29 02:00:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:27,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563939433] [2023-11-29 02:00:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:27,580 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 02:00:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563939433] [2023-11-29 02:00:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563939433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881875402] [2023-11-29 02:00:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:27,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:27,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 02:00:27,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:28,211 INFO L124 PetriNetUnfolderBase]: 1041/1733 cut-off events. [2023-11-29 02:00:28,211 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2023-11-29 02:00:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3728 conditions, 1733 events. 1041/1733 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10365 event pairs, 203 based on Foata normal form. 60/1784 useless extension candidates. Maximal degree in co-relation 3713. Up to 1065 conditions per place. [2023-11-29 02:00:28,222 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 27 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2023-11-29 02:00:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 294 flow [2023-11-29 02:00:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:00:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:00:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2023-11-29 02:00:28,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6015037593984962 [2023-11-29 02:00:28,225 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 160 transitions. [2023-11-29 02:00:28,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 160 transitions. [2023-11-29 02:00:28,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:28,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 160 transitions. [2023-11-29 02:00:28,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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 02:00:28,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:28,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:28,230 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 86 flow. Second operand 7 states and 160 transitions. [2023-11-29 02:00:28,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 294 flow [2023-11-29 02:00:28,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 274 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 02:00:28,244 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2023-11-29 02:00:28,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-11-29 02:00:28,245 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-11-29 02:00:28,245 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2023-11-29 02:00:28,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 02:00:28,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:28,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:28,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:00:28,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:28,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1611434478, now seen corresponding path program 1 times [2023-11-29 02:00:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:28,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137983053] [2023-11-29 02:00:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:28,505 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 02:00:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137983053] [2023-11-29 02:00:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137983053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:28,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:00:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058718780] [2023-11-29 02:00:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:28,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:00:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:00:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:00:28,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-29 02:00:28,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 02:00:28,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:28,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-29 02:00:28,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:29,434 INFO L124 PetriNetUnfolderBase]: 1697/2911 cut-off events. [2023-11-29 02:00:29,434 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2023-11-29 02:00:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 2911 events. 1697/2911 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18740 event pairs, 471 based on Foata normal form. 64/2959 useless extension candidates. Maximal degree in co-relation 6277. Up to 817 conditions per place. [2023-11-29 02:00:29,453 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 41 selfloop transitions, 3 changer transitions 41/94 dead transitions. [2023-11-29 02:00:29,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 94 transitions, 413 flow [2023-11-29 02:00:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:00:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:00:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2023-11-29 02:00:29,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6019736842105263 [2023-11-29 02:00:29,456 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 183 transitions. [2023-11-29 02:00:29,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 183 transitions. [2023-11-29 02:00:29,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:29,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 183 transitions. [2023-11-29 02:00:29,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 0 states have call successors, (0), 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 02:00:29,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 38.0) internal successors, (342), 9 states have internal predecessors, (342), 0 states have call successors, (0), 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 02:00:29,459 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 38.0) internal successors, (342), 9 states have internal predecessors, (342), 0 states have call successors, (0), 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 02:00:29,460 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 8 states and 183 transitions. [2023-11-29 02:00:29,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 94 transitions, 413 flow [2023-11-29 02:00:29,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 94 transitions, 389 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 02:00:29,467 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 100 flow [2023-11-29 02:00:29,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2023-11-29 02:00:29,469 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-11-29 02:00:29,469 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 100 flow [2023-11-29 02:00:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 02:00:29,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:29,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:29,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:00:29,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:29,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1844395571, now seen corresponding path program 1 times [2023-11-29 02:00:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265246550] [2023-11-29 02:00:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:30,988 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 02:00:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265246550] [2023-11-29 02:00:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265246550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:00:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189577757] [2023-11-29 02:00:30,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:30,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:30,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:30,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 02:00:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:30,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:31,369 INFO L124 PetriNetUnfolderBase]: 621/1096 cut-off events. [2023-11-29 02:00:31,369 INFO L125 PetriNetUnfolderBase]: For 511/515 co-relation queries the response was YES. [2023-11-29 02:00:31,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 1096 events. 621/1096 cut-off events. For 511/515 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6182 event pairs, 205 based on Foata normal form. 32/1122 useless extension candidates. Maximal degree in co-relation 2452. Up to 751 conditions per place. [2023-11-29 02:00:31,376 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 3 changer transitions 23/65 dead transitions. [2023-11-29 02:00:31,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 293 flow [2023-11-29 02:00:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:00:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:00:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-29 02:00:31,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-11-29 02:00:31,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-29 02:00:31,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-29 02:00:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:31,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-29 02:00:31,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 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 02:00:31,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:31,382 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 38.0) internal successors, (304), 8 states have internal predecessors, (304), 0 states have call successors, (0), 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 02:00:31,382 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 100 flow. Second operand 7 states and 154 transitions. [2023-11-29 02:00:31,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 293 flow [2023-11-29 02:00:31,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 261 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-29 02:00:31,387 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 115 flow [2023-11-29 02:00:31,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2023-11-29 02:00:31,388 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-11-29 02:00:31,388 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 115 flow [2023-11-29 02:00:31,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 02:00:31,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:31,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:31,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:00:31,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:31,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2022139761, now seen corresponding path program 1 times [2023-11-29 02:00:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051726384] [2023-11-29 02:00:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:31,996 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 02:00:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051726384] [2023-11-29 02:00:31,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051726384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:31,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:31,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:00:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990599407] [2023-11-29 02:00:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:31,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:32,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:32,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:00:32,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:32,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:32,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:32,461 INFO L124 PetriNetUnfolderBase]: 762/1317 cut-off events. [2023-11-29 02:00:32,461 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-11-29 02:00:32,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1317 events. 762/1317 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7699 event pairs, 133 based on Foata normal form. 30/1341 useless extension candidates. Maximal degree in co-relation 3295. Up to 491 conditions per place. [2023-11-29 02:00:32,472 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 30 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2023-11-29 02:00:32,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 336 flow [2023-11-29 02:00:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:00:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:00:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2023-11-29 02:00:32,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2023-11-29 02:00:32,474 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2023-11-29 02:00:32,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2023-11-29 02:00:32,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:32,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2023-11-29 02:00:32,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 02:00:32,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:32,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:32,477 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 115 flow. Second operand 6 states and 141 transitions. [2023-11-29 02:00:32,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 336 flow [2023-11-29 02:00:32,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 321 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 02:00:32,483 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 110 flow [2023-11-29 02:00:32,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2023-11-29 02:00:32,484 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-11-29 02:00:32,484 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 110 flow [2023-11-29 02:00:32,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 02:00:32,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:32,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:32,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:00:32,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:32,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 485044529, now seen corresponding path program 1 times [2023-11-29 02:00:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044281618] [2023-11-29 02:00:32,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:32,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:33,566 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 02:00:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:33,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044281618] [2023-11-29 02:00:33,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044281618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:00:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631577999] [2023-11-29 02:00:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:33,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:00:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:00:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:00:33,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:33,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 02:00:33,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:33,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:33,922 INFO L124 PetriNetUnfolderBase]: 460/828 cut-off events. [2023-11-29 02:00:33,922 INFO L125 PetriNetUnfolderBase]: For 650/650 co-relation queries the response was YES. [2023-11-29 02:00:33,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2129 conditions, 828 events. 460/828 cut-off events. For 650/650 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4526 event pairs, 302 based on Foata normal form. 24/842 useless extension candidates. Maximal degree in co-relation 2110. Up to 581 conditions per place. [2023-11-29 02:00:33,930 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 25 selfloop transitions, 5 changer transitions 14/55 dead transitions. [2023-11-29 02:00:33,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 280 flow [2023-11-29 02:00:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:00:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:00:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2023-11-29 02:00:33,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2023-11-29 02:00:33,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 129 transitions. [2023-11-29 02:00:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 129 transitions. [2023-11-29 02:00:33,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:33,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 129 transitions. [2023-11-29 02:00:33,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 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 02:00:33,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:33,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:33,935 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 110 flow. Second operand 6 states and 129 transitions. [2023-11-29 02:00:33,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 280 flow [2023-11-29 02:00:33,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 254 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-29 02:00:33,939 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 130 flow [2023-11-29 02:00:33,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2023-11-29 02:00:33,940 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-11-29 02:00:33,940 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 130 flow [2023-11-29 02:00:33,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 02:00:33,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:33,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:33,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:00:33,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:33,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -742377165, now seen corresponding path program 2 times [2023-11-29 02:00:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984247978] [2023-11-29 02:00:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:34,937 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 02:00:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:34,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984247978] [2023-11-29 02:00:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984247978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:00:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059223428] [2023-11-29 02:00:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:00:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:00:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:00:34,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:34,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 02:00:34,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:34,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:34,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:35,469 INFO L124 PetriNetUnfolderBase]: 489/902 cut-off events. [2023-11-29 02:00:35,470 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2023-11-29 02:00:35,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2472 conditions, 902 events. 489/902 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4924 event pairs, 189 based on Foata normal form. 28/930 useless extension candidates. Maximal degree in co-relation 2455. Up to 543 conditions per place. [2023-11-29 02:00:35,478 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 33 selfloop transitions, 11 changer transitions 23/78 dead transitions. [2023-11-29 02:00:35,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 432 flow [2023-11-29 02:00:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:00:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:00:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2023-11-29 02:00:35,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584795321637427 [2023-11-29 02:00:35,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 191 transitions. [2023-11-29 02:00:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 191 transitions. [2023-11-29 02:00:35,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:35,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 191 transitions. [2023-11-29 02:00:35,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.22222222222222) internal successors, (191), 9 states have internal predecessors, (191), 0 states have call successors, (0), 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 02:00:35,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 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 02:00:35,485 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 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 02:00:35,485 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 130 flow. Second operand 9 states and 191 transitions. [2023-11-29 02:00:35,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 432 flow [2023-11-29 02:00:35,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 410 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-29 02:00:35,490 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 188 flow [2023-11-29 02:00:35,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2023-11-29 02:00:35,491 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-29 02:00:35,492 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 188 flow [2023-11-29 02:00:35,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 02:00:35,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:35,492 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] [2023-11-29 02:00:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:00:35,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:35,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2057478593, now seen corresponding path program 1 times [2023-11-29 02:00:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74904544] [2023-11-29 02:00:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:35,698 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 02:00:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74904544] [2023-11-29 02:00:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74904544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:35,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110716610] [2023-11-29 02:00:35,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:35,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:00:35,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:35,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:00:35,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:00:35,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-29 02:00:35,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:35,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:35,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-29 02:00:35,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:36,127 INFO L124 PetriNetUnfolderBase]: 1172/1911 cut-off events. [2023-11-29 02:00:36,127 INFO L125 PetriNetUnfolderBase]: For 3684/3684 co-relation queries the response was YES. [2023-11-29 02:00:36,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5751 conditions, 1911 events. 1172/1911 cut-off events. For 3684/3684 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9638 event pairs, 116 based on Foata normal form. 85/1992 useless extension candidates. Maximal degree in co-relation 5731. Up to 1042 conditions per place. [2023-11-29 02:00:36,143 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 61 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2023-11-29 02:00:36,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 514 flow [2023-11-29 02:00:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:00:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:00:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2023-11-29 02:00:36,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6513157894736842 [2023-11-29 02:00:36,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 99 transitions. [2023-11-29 02:00:36,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 99 transitions. [2023-11-29 02:00:36,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:36,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 99 transitions. [2023-11-29 02:00:36,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:36,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 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 02:00:36,147 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 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 02:00:36,147 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 188 flow. Second operand 4 states and 99 transitions. [2023-11-29 02:00:36,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 514 flow [2023-11-29 02:00:36,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 481 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-11-29 02:00:36,154 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 205 flow [2023-11-29 02:00:36,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-11-29 02:00:36,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-29 02:00:36,155 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 205 flow [2023-11-29 02:00:36,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:36,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:36,155 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 02:00:36,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:00:36,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:36,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 880437430, now seen corresponding path program 1 times [2023-11-29 02:00:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:36,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731748846] [2023-11-29 02:00:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:37,368 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 02:00:37,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731748846] [2023-11-29 02:00:37,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731748846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:37,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:37,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:00:37,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82198112] [2023-11-29 02:00:37,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:37,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:00:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:00:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:00:37,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-29 02:00:37,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 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 02:00:37,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:37,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-29 02:00:37,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:37,813 INFO L124 PetriNetUnfolderBase]: 695/1258 cut-off events. [2023-11-29 02:00:37,813 INFO L125 PetriNetUnfolderBase]: For 1161/1169 co-relation queries the response was YES. [2023-11-29 02:00:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1258 events. 695/1258 cut-off events. For 1161/1169 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6689 event pairs, 150 based on Foata normal form. 24/1241 useless extension candidates. Maximal degree in co-relation 3622. Up to 669 conditions per place. [2023-11-29 02:00:37,822 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 42 selfloop transitions, 21 changer transitions 6/83 dead transitions. [2023-11-29 02:00:37,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 496 flow [2023-11-29 02:00:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:00:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 02:00:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2023-11-29 02:00:37,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2023-11-29 02:00:37,825 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 205 transitions. [2023-11-29 02:00:37,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 205 transitions. [2023-11-29 02:00:37,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:37,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 205 transitions. [2023-11-29 02:00:37,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 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 02:00:37,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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 02:00:37,828 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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 02:00:37,828 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 205 flow. Second operand 10 states and 205 transitions. [2023-11-29 02:00:37,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 496 flow [2023-11-29 02:00:37,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 476 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-29 02:00:37,833 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 346 flow [2023-11-29 02:00:37,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=346, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-11-29 02:00:37,834 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-11-29 02:00:37,834 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 346 flow [2023-11-29 02:00:37,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 0 states have call successors, (0), 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 02:00:37,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:37,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:37,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:00:37,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:37,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 392425738, now seen corresponding path program 1 times [2023-11-29 02:00:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608733959] [2023-11-29 02:00:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:38,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 02:00:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:38,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608733959] [2023-11-29 02:00:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608733959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:38,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729070591] [2023-11-29 02:00:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:38,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:38,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:38,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:38,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-29 02:00:38,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 02:00:38,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:38,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-29 02:00:38,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:38,392 INFO L124 PetriNetUnfolderBase]: 857/1427 cut-off events. [2023-11-29 02:00:38,392 INFO L125 PetriNetUnfolderBase]: For 2744/2744 co-relation queries the response was YES. [2023-11-29 02:00:38,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1427 events. 857/1427 cut-off events. For 2744/2744 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6598 event pairs, 47 based on Foata normal form. 74/1497 useless extension candidates. Maximal degree in co-relation 4628. Up to 613 conditions per place. [2023-11-29 02:00:38,401 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 66 selfloop transitions, 8 changer transitions 6/88 dead transitions. [2023-11-29 02:00:38,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 698 flow [2023-11-29 02:00:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:00:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2023-11-29 02:00:38,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6473684210526316 [2023-11-29 02:00:38,402 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 123 transitions. [2023-11-29 02:00:38,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 123 transitions. [2023-11-29 02:00:38,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:38,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 123 transitions. [2023-11-29 02:00:38,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 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 02:00:38,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 02:00:38,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 02:00:38,404 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 346 flow. Second operand 5 states and 123 transitions. [2023-11-29 02:00:38,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 698 flow [2023-11-29 02:00:38,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 659 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-11-29 02:00:38,410 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 279 flow [2023-11-29 02:00:38,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-11-29 02:00:38,411 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-11-29 02:00:38,411 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 279 flow [2023-11-29 02:00:38,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 02:00:38,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:38,411 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] [2023-11-29 02:00:38,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:00:38,412 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:38,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -791698593, now seen corresponding path program 1 times [2023-11-29 02:00:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:38,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408283277] [2023-11-29 02:00:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:38,674 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 02:00:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408283277] [2023-11-29 02:00:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408283277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:38,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:38,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:00:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996664579] [2023-11-29 02:00:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:00:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:00:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:00:38,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-29 02:00:38,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 45 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:38,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:00:38,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-29 02:00:38,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:00:38,924 INFO L124 PetriNetUnfolderBase]: 474/790 cut-off events. [2023-11-29 02:00:38,925 INFO L125 PetriNetUnfolderBase]: For 1919/1919 co-relation queries the response was YES. [2023-11-29 02:00:38,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 790 events. 474/790 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3079 event pairs, 34 based on Foata normal form. 40/826 useless extension candidates. Maximal degree in co-relation 2780. Up to 308 conditions per place. [2023-11-29 02:00:38,930 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 57 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2023-11-29 02:00:38,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 577 flow [2023-11-29 02:00:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:00:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:00:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2023-11-29 02:00:38,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-11-29 02:00:38,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 132 transitions. [2023-11-29 02:00:38,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 132 transitions. [2023-11-29 02:00:38,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:00:38,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 132 transitions. [2023-11-29 02:00:38,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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 02:00:38,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:38,934 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 38.0) internal successors, (266), 7 states have internal predecessors, (266), 0 states have call successors, (0), 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 02:00:38,934 INFO L175 Difference]: Start difference. First operand has 69 places, 45 transitions, 279 flow. Second operand 6 states and 132 transitions. [2023-11-29 02:00:38,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 577 flow [2023-11-29 02:00:38,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 436 flow, removed 26 selfloop flow, removed 13 redundant places. [2023-11-29 02:00:38,939 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 210 flow [2023-11-29 02:00:38,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-11-29 02:00:38,940 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-11-29 02:00:38,940 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 210 flow [2023-11-29 02:00:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:38,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:00:38,940 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] [2023-11-29 02:00:38,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:00:38,940 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 02:00:38,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 538826752, now seen corresponding path program 1 times [2023-11-29 02:00:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136757356] [2023-11-29 02:00:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:00:39,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:00:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:00:39,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:00:39,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:00:39,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 02:00:39,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 02:00:39,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 02:00:39,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 02:00:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:00:39,143 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:39,149 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:00:39,149 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:00:39,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-29 02:00:39,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-29 02:00:39,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-29 02:00:39,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:00:39 BasicIcfg [2023-11-29 02:00:39,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:00:39,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:00:39,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:00:39,271 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:00:39,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:25" (3/4) ... [2023-11-29 02:00:39,272 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 02:00:39,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-29 02:00:39,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-29 02:00:39,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-29 02:00:39,396 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:00:39,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:00:39,396 INFO L158 Benchmark]: Toolchain (without parser) took 15761.90ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 124.6MB in the beginning and 438.9MB in the end (delta: -314.3MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,397 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:00:39,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.47ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 98.0MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.88ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,398 INFO L158 Benchmark]: Boogie Preprocessor took 66.32ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 89.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,398 INFO L158 Benchmark]: RCFGBuilder took 1028.47ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 62.7MB in the end (delta: 26.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,399 INFO L158 Benchmark]: TraceAbstraction took 13893.33ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 61.8MB in the beginning and 458.8MB in the end (delta: -396.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,399 INFO L158 Benchmark]: Witness Printer took 125.49ms. Allocated memory is still 520.1MB. Free memory was 458.8MB in the beginning and 438.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 02:00:39,401 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.16ms. Allocated memory is still 109.1MB. Free memory is still 78.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.47ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 98.0MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.88ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 95.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.32ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 89.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1028.47ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 62.7MB in the end (delta: 26.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13893.33ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 61.8MB in the beginning and 458.8MB in the end (delta: -396.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. * Witness Printer took 125.49ms. Allocated memory is still 520.1MB. Free memory was 458.8MB in the beginning and 438.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre37 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1777; [L854] FCALL, FORK 0 pthread_create(&t1777, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1777={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t1778; [L856] FCALL, FORK 0 pthread_create(&t1778, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1777={6:0}, t1778={7:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t1779; [L858] FCALL, FORK 0 pthread_create(&t1779, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1777={6:0}, t1778={7:0}, t1779={5:0}, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1777={6:0}, t1778={7:0}, t1779={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1777={6:0}, t1778={7:0}, t1779={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1777={6:0}, t1778={7:0}, t1779={5:0}, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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, 62 locations, 4 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: 13.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1444 IncrementalHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 25 mSDtfsCounter, 1444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 02:00:39,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54826671-f563-42ad-b715-fdc585801768/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