./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:33:11,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:33:11,674 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:33:11,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:33:11,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:33:11,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:33:11,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:33:11,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:33:11,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:33:11,726 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:33:11,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:33:11,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:33:11,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:33:11,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:33:11,731 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:33:11,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:33:11,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:33:11,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:33:11,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:33:11,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:33:11,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:33:11,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:33:11,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:33:11,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:33:11,736 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:33:11,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:33:11,737 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:33:11,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:33:11,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:33:11,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:33:11,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:33:11,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:33:11,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:33:11,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:33:11,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:33:11,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:33:11,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:33:11,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:33:11,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:33:11,745 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:33:11,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:33:11,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:33:11,746 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_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 [2023-11-23 21:33:12,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:33:12,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:33:12,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:33:12,125 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:33:12,126 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:33:12,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2023-11-23 21:33:15,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:33:15,990 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:33:15,990 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2023-11-23 21:33:16,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/data/f20ad2ac3/b5d844f71441488ebe7ae90f1ed41337/FLAG520073739 [2023-11-23 21:33:16,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/data/f20ad2ac3/b5d844f71441488ebe7ae90f1ed41337 [2023-11-23 21:33:16,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:33:16,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:33:16,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:33:16,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:33:16,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:33:16,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:16,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ac4ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16, skipping insertion in model container [2023-11-23 21:33:16,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:16,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:33:16,378 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_adb59f69-b275-4190-aea7-4f1c04cc2770/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i[995,1008] [2023-11-23 21:33:16,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:33:16,753 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:33:16,770 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_adb59f69-b275-4190-aea7-4f1c04cc2770/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i[995,1008] [2023-11-23 21:33:16,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:33:16,941 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:33:16,941 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:33:16,949 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:33:16,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16 WrapperNode [2023-11-23 21:33:16,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:33:16,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:33:16,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:33:16,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:33:16,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,075 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-11-23 21:33:17,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:33:17,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:33:17,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:33:17,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:33:17,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,112 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,145 INFO L189 HeapSplitter]: Split 35 memory accesses to 5 slices as follows [2, 1, 1, 30, 1] [2023-11-23 21:33:17,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:33:17,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:33:17,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:33:17,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:33:17,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (1/1) ... [2023-11-23 21:33:17,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:33:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:33:17,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:33:17,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:33:17,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 21:33:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 21:33:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 21:33:17,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 21:33:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 21:33:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 21:33:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 21:33:17,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 21:33:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 21:33:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 21:33:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:33:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:33:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:33:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:33:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:33:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:33:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:33:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:33:17,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:33:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:33:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 21:33:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 21:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 21:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 21:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:33:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:33:17,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:33:17,277 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:33:17,584 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:33:17,587 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:33:18,323 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:33:19,011 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:33:19,012 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:33:19,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:33:19 BoogieIcfgContainer [2023-11-23 21:33:19,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:33:19,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:33:19,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:33:19,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:33:19,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:33:16" (1/3) ... [2023-11-23 21:33:19,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfeed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:33:19, skipping insertion in model container [2023-11-23 21:33:19,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:16" (2/3) ... [2023-11-23 21:33:19,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfeed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:33:19, skipping insertion in model container [2023-11-23 21:33:19,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:33:19" (3/3) ... [2023-11-23 21:33:19,030 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2023-11-23 21:33:19,043 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:33:19,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:33:19,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:33:19,058 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:33:19,157 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:33:19,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2023-11-23 21:33:19,261 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-11-23 21:33:19,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:33:19,296 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-23 21:33:19,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2023-11-23 21:33:19,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2023-11-23 21:33:19,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:33:19,316 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;@1c92fc1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:33:19,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-23 21:33:19,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:33:19,334 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-11-23 21:33:19,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:33:19,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:19,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:19,335 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-23 21:33:19,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1371394576, now seen corresponding path program 1 times [2023-11-23 21:33:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641504412] [2023-11-23 21:33:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641504412] [2023-11-23 21:33:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641504412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:33:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685463312] [2023-11-23 21:33:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:33:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:33:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:33:20,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:20,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 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-23 21:33:20,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:20,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:20,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:21,716 INFO L124 PetriNetUnfolderBase]: 1041/1733 cut-off events. [2023-11-23 21:33:21,716 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-23 21:33:21,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 1733 events. 1041/1733 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10543 event pairs, 203 based on Foata normal form. 60/1784 useless extension candidates. Maximal degree in co-relation 3335. Up to 1065 conditions per place. [2023-11-23 21:33:21,740 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 27 selfloop transitions, 2 changer transitions 31/71 dead transitions. [2023-11-23 21:33:21,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 271 flow [2023-11-23 21:33:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:33:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2023-11-23 21:33:21,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6015037593984962 [2023-11-23 21:33:21,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 160 transitions. [2023-11-23 21:33:21,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 160 transitions. [2023-11-23 21:33:21,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:21,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 160 transitions. [2023-11-23 21:33:21,775 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-23 21:33:21,784 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-23 21:33:21,784 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-23 21:33:21,786 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 160 transitions. [2023-11-23 21:33:21,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 271 flow [2023-11-23 21:33:21,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 21:33:21,799 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 86 flow [2023-11-23 21:33:21,802 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-23 21:33:21,807 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-23 21:33:21,807 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 86 flow [2023-11-23 21:33:21,808 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-23 21:33:21,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:21,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:21,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:33:21,809 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-23 21:33:21,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash -441813843, now seen corresponding path program 1 times [2023-11-23 21:33:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100175858] [2023-11-23 21:33:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100175858] [2023-11-23 21:33:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100175858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:22,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:33:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564523960] [2023-11-23 21:33:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:22,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:33:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:33:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:33:22,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:22,311 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.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:22,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:22,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:22,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:23,105 INFO L124 PetriNetUnfolderBase]: 879/1721 cut-off events. [2023-11-23 21:33:23,106 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-23 21:33:23,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 1721 events. 879/1721 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11214 event pairs, 159 based on Foata normal form. 48/1730 useless extension candidates. Maximal degree in co-relation 3457. Up to 869 conditions per place. [2023-11-23 21:33:23,124 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 33 selfloop transitions, 2 changer transitions 31/77 dead transitions. [2023-11-23 21:33:23,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 325 flow [2023-11-23 21:33:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:33:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2023-11-23 21:33:23,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6240601503759399 [2023-11-23 21:33:23,136 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 166 transitions. [2023-11-23 21:33:23,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 166 transitions. [2023-11-23 21:33:23,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:23,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 166 transitions. [2023-11-23 21:33:23,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:23,148 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-23 21:33:23,149 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-23 21:33:23,149 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 86 flow. Second operand 7 states and 166 transitions. [2023-11-23 21:33:23,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 325 flow [2023-11-23 21:33:23,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 303 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-23 21:33:23,170 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2023-11-23 21:33:23,171 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-23 21:33:23,172 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2023-11-23 21:33:23,172 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2023-11-23 21:33:23,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:23,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:23,173 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-23 21:33:23,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:33:23,174 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-23 21:33:23,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1968539310, now seen corresponding path program 1 times [2023-11-23 21:33:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975671133] [2023-11-23 21:33:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975671133] [2023-11-23 21:33:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975671133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:26,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:33:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786664988] [2023-11-23 21:33:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:26,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:33:26,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:26,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:33:26,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:33:26,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:26,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:26,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:26,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:26,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:27,038 INFO L124 PetriNetUnfolderBase]: 786/1352 cut-off events. [2023-11-23 21:33:27,038 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2023-11-23 21:33:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 1352 events. 786/1352 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8170 event pairs, 229 based on Foata normal form. 32/1378 useless extension candidates. Maximal degree in co-relation 3065. Up to 982 conditions per place. [2023-11-23 21:33:27,055 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 3 changer transitions 23/65 dead transitions. [2023-11-23 21:33:27,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 282 flow [2023-11-23 21:33:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:33:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-23 21:33:27,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-11-23 21:33:27,059 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-23 21:33:27,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-23 21:33:27,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:27,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-23 21:33:27,062 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-23 21:33:27,065 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-23 21:33:27,065 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-23 21:33:27,066 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 7 states and 154 transitions. [2023-11-23 21:33:27,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 282 flow [2023-11-23 21:33:27,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 260 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-23 21:33:27,075 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 113 flow [2023-11-23 21:33:27,075 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-11-23 21:33:27,077 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-11-23 21:33:27,078 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 113 flow [2023-11-23 21:33:27,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:27,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:27,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:27,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:33:27,081 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-23 21:33:27,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash 794991384, now seen corresponding path program 1 times [2023-11-23 21:33:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551759910] [2023-11-23 21:33:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551759910] [2023-11-23 21:33:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551759910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:33:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777833840] [2023-11-23 21:33:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:33:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:33:28,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:33:28,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:28,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 113 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-23 21:33:28,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:28,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:28,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:29,497 INFO L124 PetriNetUnfolderBase]: 1126/1896 cut-off events. [2023-11-23 21:33:29,497 INFO L125 PetriNetUnfolderBase]: For 1209/1209 co-relation queries the response was YES. [2023-11-23 21:33:29,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 1896 events. 1126/1896 cut-off events. For 1209/1209 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11976 event pairs, 201 based on Foata normal form. 30/1920 useless extension candidates. Maximal degree in co-relation 4874. Up to 744 conditions per place. [2023-11-23 21:33:29,517 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 35 selfloop transitions, 4 changer transitions 31/81 dead transitions. [2023-11-23 21:33:29,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 417 flow [2023-11-23 21:33:29,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:33:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:33:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2023-11-23 21:33:29,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6203007518796992 [2023-11-23 21:33:29,520 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 165 transitions. [2023-11-23 21:33:29,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 165 transitions. [2023-11-23 21:33:29,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:29,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 165 transitions. [2023-11-23 21:33:29,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:29,523 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-23 21:33:29,523 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-23 21:33:29,524 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 113 flow. Second operand 7 states and 165 transitions. [2023-11-23 21:33:29,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 417 flow [2023-11-23 21:33:29,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 404 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-23 21:33:29,538 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 144 flow [2023-11-23 21:33:29,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2023-11-23 21:33:29,541 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-23 21:33:29,541 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 144 flow [2023-11-23 21:33:29,542 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-23 21:33:29,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:29,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:29,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:33:29,544 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-23 21:33:29,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1727664252, now seen corresponding path program 2 times [2023-11-23 21:33:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183650318] [2023-11-23 21:33:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:31,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183650318] [2023-11-23 21:33:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183650318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:33:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005519845] [2023-11-23 21:33:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:33:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:33:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:33:31,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:31,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 144 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-23 21:33:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:32,101 INFO L124 PetriNetUnfolderBase]: 710/1219 cut-off events. [2023-11-23 21:33:32,102 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2023-11-23 21:33:32,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 1219 events. 710/1219 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7163 event pairs, 94 based on Foata normal form. 30/1243 useless extension candidates. Maximal degree in co-relation 3495. Up to 655 conditions per place. [2023-11-23 21:33:32,117 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 32 selfloop transitions, 4 changer transitions 22/69 dead transitions. [2023-11-23 21:33:32,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 388 flow [2023-11-23 21:33:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:33:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:33:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2023-11-23 21:33:32,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2023-11-23 21:33:32,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 142 transitions. [2023-11-23 21:33:32,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 142 transitions. [2023-11-23 21:33:32,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:32,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 142 transitions. [2023-11-23 21:33:32,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:32,122 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-23 21:33:32,122 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-23 21:33:32,122 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 144 flow. Second operand 6 states and 142 transitions. [2023-11-23 21:33:32,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 388 flow [2023-11-23 21:33:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 365 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-23 21:33:32,132 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 134 flow [2023-11-23 21:33:32,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-11-23 21:33:32,137 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-23 21:33:32,137 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 134 flow [2023-11-23 21:33:32,137 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-23 21:33:32,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:32,138 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-23 21:33:32,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:33:32,138 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-23 21:33:32,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2099850393, now seen corresponding path program 1 times [2023-11-23 21:33:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663895970] [2023-11-23 21:33:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663895970] [2023-11-23 21:33:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663895970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:33:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985498859] [2023-11-23 21:33:33,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:33,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:33:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:33:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:33:33,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:33,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 134 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-23 21:33:33,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:33,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:33,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:34,162 INFO L124 PetriNetUnfolderBase]: 673/1174 cut-off events. [2023-11-23 21:33:34,163 INFO L125 PetriNetUnfolderBase]: For 1184/1184 co-relation queries the response was YES. [2023-11-23 21:33:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 1174 events. 673/1174 cut-off events. For 1184/1184 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6770 event pairs, 313 based on Foata normal form. 24/1187 useless extension candidates. Maximal degree in co-relation 3265. Up to 841 conditions per place. [2023-11-23 21:33:34,180 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 29 selfloop transitions, 8 changer transitions 14/62 dead transitions. [2023-11-23 21:33:34,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 344 flow [2023-11-23 21:33:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:33:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:33:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2023-11-23 21:33:34,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-23 21:33:34,182 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 133 transitions. [2023-11-23 21:33:34,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 133 transitions. [2023-11-23 21:33:34,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:34,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 133 transitions. [2023-11-23 21:33:34,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:34,185 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-23 21:33:34,186 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-23 21:33:34,186 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 134 flow. Second operand 6 states and 133 transitions. [2023-11-23 21:33:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 344 flow [2023-11-23 21:33:34,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 315 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-23 21:33:34,193 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 187 flow [2023-11-23 21:33:34,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-11-23 21:33:34,197 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-23 21:33:34,198 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 187 flow [2023-11-23 21:33:34,198 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-23 21:33:34,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:34,199 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-23 21:33:34,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:33:34,199 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-23 21:33:34,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -253464797, now seen corresponding path program 2 times [2023-11-23 21:33:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048765353] [2023-11-23 21:33:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048765353] [2023-11-23 21:33:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048765353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:35,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:33:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867923733] [2023-11-23 21:33:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:35,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:33:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:33:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:33:35,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2023-11-23 21:33:35,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 187 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-23 21:33:35,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:35,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2023-11-23 21:33:35,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:36,455 INFO L124 PetriNetUnfolderBase]: 660/1177 cut-off events. [2023-11-23 21:33:36,455 INFO L125 PetriNetUnfolderBase]: For 1436/1439 co-relation queries the response was YES. [2023-11-23 21:33:36,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3585 conditions, 1177 events. 660/1177 cut-off events. For 1436/1439 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6760 event pairs, 89 based on Foata normal form. 26/1201 useless extension candidates. Maximal degree in co-relation 3564. Up to 519 conditions per place. [2023-11-23 21:33:36,472 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 38 selfloop transitions, 15 changer transitions 21/85 dead transitions. [2023-11-23 21:33:36,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 502 flow [2023-11-23 21:33:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:33:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 21:33:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 213 transitions. [2023-11-23 21:33:36,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5605263157894737 [2023-11-23 21:33:36,477 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 213 transitions. [2023-11-23 21:33:36,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 213 transitions. [2023-11-23 21:33:36,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:36,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 213 transitions. [2023-11-23 21:33:36,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:36,481 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-23 21:33:36,483 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-23 21:33:36,483 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 187 flow. Second operand 10 states and 213 transitions. [2023-11-23 21:33:36,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 502 flow [2023-11-23 21:33:36,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 459 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-23 21:33:36,498 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 246 flow [2023-11-23 21:33:36,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2023-11-23 21:33:36,500 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-11-23 21:33:36,500 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 246 flow [2023-11-23 21:33:36,501 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-23 21:33:36,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:36,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:36,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:33:36,504 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-23 21:33:36,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2131158841, now seen corresponding path program 1 times [2023-11-23 21:33:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601087249] [2023-11-23 21:33:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:36,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601087249] [2023-11-23 21:33:36,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601087249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:36,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:36,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:33:36,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434607953] [2023-11-23 21:33:36,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:36,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:33:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:36,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:33:36,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:33:36,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-23 21:33:36,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 246 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-23 21:33:36,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:36,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-23 21:33:36,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:37,765 INFO L124 PetriNetUnfolderBase]: 1513/2413 cut-off events. [2023-11-23 21:33:37,765 INFO L125 PetriNetUnfolderBase]: For 3673/3673 co-relation queries the response was YES. [2023-11-23 21:33:37,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7609 conditions, 2413 events. 1513/2413 cut-off events. For 3673/3673 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12866 event pairs, 150 based on Foata normal form. 118/2521 useless extension candidates. Maximal degree in co-relation 7584. Up to 1197 conditions per place. [2023-11-23 21:33:37,833 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 66 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2023-11-23 21:33:37,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 589 flow [2023-11-23 21:33:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:33:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:33:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2023-11-23 21:33:37,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6644736842105263 [2023-11-23 21:33:37,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 101 transitions. [2023-11-23 21:33:37,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 101 transitions. [2023-11-23 21:33:37,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:37,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 101 transitions. [2023-11-23 21:33:37,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:37,839 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-23 21:33:37,839 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-23 21:33:37,840 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 246 flow. Second operand 4 states and 101 transitions. [2023-11-23 21:33:37,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 589 flow [2023-11-23 21:33:37,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 528 flow, removed 21 selfloop flow, removed 8 redundant places. [2023-11-23 21:33:37,854 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 236 flow [2023-11-23 21:33:37,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-11-23 21:33:37,890 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-23 21:33:37,890 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 236 flow [2023-11-23 21:33:37,890 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-23 21:33:37,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:37,890 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-23 21:33:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:33:37,891 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-23 21:33:37,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1339157966, now seen corresponding path program 1 times [2023-11-23 21:33:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745802973] [2023-11-23 21:33:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745802973] [2023-11-23 21:33:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745802973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:38,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:38,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:33:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5436334] [2023-11-23 21:33:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:33:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:33:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:33:38,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-23 21:33:38,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:38,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:38,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-23 21:33:38,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:39,022 INFO L124 PetriNetUnfolderBase]: 1037/1693 cut-off events. [2023-11-23 21:33:39,022 INFO L125 PetriNetUnfolderBase]: For 2025/2031 co-relation queries the response was YES. [2023-11-23 21:33:39,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1693 events. 1037/1693 cut-off events. For 2025/2031 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8212 event pairs, 73 based on Foata normal form. 100/1785 useless extension candidates. Maximal degree in co-relation 5343. Up to 545 conditions per place. [2023-11-23 21:33:39,044 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 70 selfloop transitions, 8 changer transitions 1/87 dead transitions. [2023-11-23 21:33:39,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 579 flow [2023-11-23 21:33:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:33:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:33:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-23 21:33:39,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2023-11-23 21:33:39,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-23 21:33:39,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-23 21:33:39,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:39,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-23 21:33:39,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:39,048 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-23 21:33:39,048 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-23 21:33:39,048 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 236 flow. Second operand 5 states and 126 transitions. [2023-11-23 21:33:39,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 579 flow [2023-11-23 21:33:39,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 551 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-23 21:33:39,059 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 239 flow [2023-11-23 21:33:39,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-11-23 21:33:39,061 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-11-23 21:33:39,061 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 239 flow [2023-11-23 21:33:39,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:39,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:39,062 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] [2023-11-23 21:33:39,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:33:39,062 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-23 21:33:39,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 915631147, now seen corresponding path program 1 times [2023-11-23 21:33:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:39,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913135781] [2023-11-23 21:33:39,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913135781] [2023-11-23 21:33:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913135781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:33:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935195072] [2023-11-23 21:33:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:39,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:33:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:33:39,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:33:39,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-23 21:33:39,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:39,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:39,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-23 21:33:39,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:40,111 INFO L124 PetriNetUnfolderBase]: 649/1065 cut-off events. [2023-11-23 21:33:40,112 INFO L125 PetriNetUnfolderBase]: For 1733/1745 co-relation queries the response was YES. [2023-11-23 21:33:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3561 conditions, 1065 events. 649/1065 cut-off events. For 1733/1745 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4653 event pairs, 53 based on Foata normal form. 52/1109 useless extension candidates. Maximal degree in co-relation 3541. Up to 360 conditions per place. [2023-11-23 21:33:40,128 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 61 selfloop transitions, 11 changer transitions 1/81 dead transitions. [2023-11-23 21:33:40,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 533 flow [2023-11-23 21:33:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:33:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:33:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2023-11-23 21:33:40,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2023-11-23 21:33:40,130 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 134 transitions. [2023-11-23 21:33:40,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 134 transitions. [2023-11-23 21:33:40,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:40,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 134 transitions. [2023-11-23 21:33:40,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:40,133 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-23 21:33:40,134 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-23 21:33:40,134 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 239 flow. Second operand 6 states and 134 transitions. [2023-11-23 21:33:40,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 533 flow [2023-11-23 21:33:40,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 468 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-23 21:33:40,144 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 221 flow [2023-11-23 21:33:40,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-23 21:33:40,146 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-11-23 21:33:40,147 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 221 flow [2023-11-23 21:33:40,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:40,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:40,147 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-23 21:33:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:33:40,148 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-23 21:33:40,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 662610400, now seen corresponding path program 1 times [2023-11-23 21:33:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546895324] [2023-11-23 21:33:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:33:40,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:40,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546895324] [2023-11-23 21:33:40,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546895324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:40,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:40,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:33:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086466414] [2023-11-23 21:33:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:40,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:33:40,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:33:40,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:33:40,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2023-11-23 21:33:40,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:40,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:33:40,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2023-11-23 21:33:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:33:41,212 INFO L124 PetriNetUnfolderBase]: 720/1354 cut-off events. [2023-11-23 21:33:41,212 INFO L125 PetriNetUnfolderBase]: For 1283/1299 co-relation queries the response was YES. [2023-11-23 21:33:41,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1354 events. 720/1354 cut-off events. For 1283/1299 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7399 event pairs, 143 based on Foata normal form. 8/1332 useless extension candidates. Maximal degree in co-relation 3762. Up to 613 conditions per place. [2023-11-23 21:33:41,232 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 30 selfloop transitions, 1 changer transitions 30/76 dead transitions. [2023-11-23 21:33:41,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 452 flow [2023-11-23 21:33:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:33:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:33:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2023-11-23 21:33:41,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2023-11-23 21:33:41,234 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 123 transitions. [2023-11-23 21:33:41,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 123 transitions. [2023-11-23 21:33:41,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:33:41,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 123 transitions. [2023-11-23 21:33:41,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 20.5) internal successors, (123), 6 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-23 21:33:41,236 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-23 21:33:41,237 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-23 21:33:41,237 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 221 flow. Second operand 6 states and 123 transitions. [2023-11-23 21:33:41,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 452 flow [2023-11-23 21:33:41,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 388 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-23 21:33:41,250 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 158 flow [2023-11-23 21:33:41,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-11-23 21:33:41,251 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-11-23 21:33:41,251 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 158 flow [2023-11-23 21:33:41,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:33:41,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:33:41,252 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-23 21:33:41,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:33:41,252 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-23 21:33:41,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash -461694430, now seen corresponding path program 2 times [2023-11-23 21:33:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633983305] [2023-11-23 21:33:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:33:41,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:33:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:33:41,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:33:41,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:33:41,638 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-23 21:33:41,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-23 21:33:41,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-23 21:33:41,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-23 21:33:41,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:33:41,642 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:41,649 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:33:41,649 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:33:41,754 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-23 21:33:41,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-23 21:33:41,772 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-23 21:33:41,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:33:41 BasicIcfg [2023-11-23 21:33:41,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:33:41,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:33:41,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:33:41,839 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:33:41,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:33:19" (3/4) ... [2023-11-23 21:33:41,841 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 21:33:41,901 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre33 could not be translated [2023-11-23 21:33:41,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre35 could not be translated [2023-11-23 21:33:41,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre37 could not be translated [2023-11-23 21:33:42,037 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/witness.graphml [2023-11-23 21:33:42,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:33:42,038 INFO L158 Benchmark]: Toolchain (without parser) took 25999.21ms. Allocated memory was 119.5MB in the beginning and 494.9MB in the end (delta: 375.4MB). Free memory was 87.0MB in the beginning and 331.9MB in the end (delta: -244.9MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,038 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:33:42,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 910.39ms. Allocated memory is still 119.5MB. Free memory was 87.0MB in the beginning and 60.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.92ms. Allocated memory is still 119.5MB. Free memory was 60.1MB in the beginning and 57.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,039 INFO L158 Benchmark]: Boogie Preprocessor took 104.44ms. Allocated memory is still 119.5MB. Free memory was 57.2MB in the beginning and 52.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,040 INFO L158 Benchmark]: RCFGBuilder took 1831.46ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 52.0MB in the beginning and 69.4MB in the end (delta: -17.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,041 INFO L158 Benchmark]: TraceAbstraction took 22818.92ms. Allocated memory was 153.1MB in the beginning and 494.9MB in the end (delta: 341.8MB). Free memory was 68.3MB in the beginning and 351.8MB in the end (delta: -283.5MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,041 INFO L158 Benchmark]: Witness Printer took 198.27ms. Allocated memory is still 494.9MB. Free memory was 351.8MB in the beginning and 331.9MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-23 21:33:42,043 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.36ms. Allocated memory is still 119.5MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 910.39ms. Allocated memory is still 119.5MB. Free memory was 87.0MB in the beginning and 60.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.92ms. Allocated memory is still 119.5MB. Free memory was 60.1MB in the beginning and 57.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.44ms. Allocated memory is still 119.5MB. Free memory was 57.2MB in the beginning and 52.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1831.46ms. Allocated memory was 119.5MB in the beginning and 153.1MB in the end (delta: 33.6MB). Free memory was 52.0MB in the beginning and 69.4MB in the end (delta: -17.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22818.92ms. Allocated memory was 153.1MB in the beginning and 494.9MB in the end (delta: 341.8MB). Free memory was 68.3MB in the beginning and 351.8MB in the end (delta: -283.5MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 198.27ms. Allocated memory is still 494.9MB. Free memory was 351.8MB in the beginning and 331.9MB in the end (delta: 19.9MB). 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_p0_EBX = 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 t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825={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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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 t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1825={6:0}, t1826={7:0}, weak$$choice0=0, 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 __unbuffered_p0_EBX = 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_p0_EBX=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=0, 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}] [L857] 0 pthread_t t1827; [L858] FCALL, FORK 0 pthread_create(&t1827, ((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_p0_EBX=0, __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, t1825={6:0}, t1826={7:0}, t1827={5:0}, weak$$choice0=0, 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}] [L792] 2 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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 \read(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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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=0, 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_p0_EBX=0, __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, t1825={6:0}, t1826={7:0}, t1827={5:0}, weak$$choice1=1, weak$$choice2=0, 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_p0_EBX=0, __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, t1825={6:0}, t1826={7:0}, t1827={5:0}, weak$$choice1=1, weak$$choice2=0, 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_p0_EBX == 0 && __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_p0_EBX=0, __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, t1825={6:0}, t1826={7:0}, t1827={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_p0_EBX=0, __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_p0_EBX=0, __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: 22.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1409 IncrementalHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 9 mSDtfsCounter, 1409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=7, InterpolantAutomatonStates: 71, 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.9s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 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-23 21:33:42,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adb59f69-b275-4190-aea7-4f1c04cc2770/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE