./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX --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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:01:02,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:01:02,647 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:01:02,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:01:02,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:01:02,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:01:02,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:01:02,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:01:02,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:01:02,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:01:02,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:01:02,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:01:02,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:01:02,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:01:02,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:01:02,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:01:02,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:01:02,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:01:02,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:01:02,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:01:02,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:01:02,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:01:02,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:01:02,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:01:02,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:01:02,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:01:02,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:01:02,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:01:02,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:01:02,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:01:02,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:01:02,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:01:02,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:01:02,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:01:02,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:01:02,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:01:02,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:01:02,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:01:02,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:01:02,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:01:02,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:01:02,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:01:02,754 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_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/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_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2024-11-08 18:01:03,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:01:03,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:01:03,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:01:03,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:01:03,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:01:03,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-08 18:01:05,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:01:06,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:01:06,316 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-08 18:01:06,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/data/11a24d1c7/e1c5da64ccd64248a33454c8e8a3abf8/FLAG21c81b3ad [2024-11-08 18:01:06,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/data/11a24d1c7/e1c5da64ccd64248a33454c8e8a3abf8 [2024-11-08 18:01:06,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:01:06,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:01:06,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:01:06,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:01:06,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:01:06,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:01:06" (1/1) ... [2024-11-08 18:01:06,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777a4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:06, skipping insertion in model container [2024-11-08 18:01:06,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:01:06" (1/1) ... [2024-11-08 18:01:06,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:01:06,843 WARN L250 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_12ed2891-5ce9-484b-83c2-1d84388c121e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-11-08 18:01:07,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:01:07,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:01:07,247 WARN L250 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_12ed2891-5ce9-484b-83c2-1d84388c121e/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-11-08 18:01:07,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:01:07,390 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:01:07,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07 WrapperNode [2024-11-08 18:01:07,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:01:07,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:01:07,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:01:07,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:01:07,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,479 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-08 18:01:07,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:01:07,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:01:07,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:01:07,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:01:07,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:01:07,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:01:07,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:01:07,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:01:07,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:01:07,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (1/1) ... [2024-11-08 18:01:07,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:01:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:01:07,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:01:07,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:01:07,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:01:07,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:01:07,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 18:01:07,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 18:01:07,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 18:01:07,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 18:01:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-08 18:01:07,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-08 18:01:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-08 18:01:07,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-08 18:01:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:01:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:01:07,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:01:07,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:01:07,753 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:01:08,031 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:01:08,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:01:08,717 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:01:08,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:01:09,158 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:01:09,159 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:01:09,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:09 BoogieIcfgContainer [2024-11-08 18:01:09,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:01:09,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:01:09,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:01:09,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:01:09,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:01:06" (1/3) ... [2024-11-08 18:01:09,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b917149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:01:09, skipping insertion in model container [2024-11-08 18:01:09,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:07" (2/3) ... [2024-11-08 18:01:09,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b917149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:01:09, skipping insertion in model container [2024-11-08 18:01:09,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:09" (3/3) ... [2024-11-08 18:01:09,178 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-11-08 18:01:09,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:01:09,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 18:01:09,209 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:01:09,341 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 18:01:09,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-11-08 18:01:09,445 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-11-08 18:01:09,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:01:09,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-11-08 18:01:09,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-11-08 18:01:09,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-11-08 18:01:09,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:01:09,501 INFO L333 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, 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;@7ff3b472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:01:09,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 18:01:09,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:01:09,512 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-08 18:01:09,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:01:09,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:09,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 18:01:09,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:09,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 12344482, now seen corresponding path program 1 times [2024-11-08 18:01:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251886866] [2024-11-08 18:01:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251886866] [2024-11-08 18:01:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251886866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 18:01:10,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035415127] [2024-11-08 18:01:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:10,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:01:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:01:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:01:10,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-11-08 18:01:10,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:10,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:10,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-11-08 18:01:10,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:12,213 INFO L124 PetriNetUnfolderBase]: 2495/4172 cut-off events. [2024-11-08 18:01:12,213 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-08 18:01:12,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7748 conditions, 4172 events. 2495/4172 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29343 event pairs, 443 based on Foata normal form. 144/4245 useless extension candidates. Maximal degree in co-relation 7736. Up to 2779 conditions per place. [2024-11-08 18:01:12,258 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 37 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-11-08 18:01:12,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 223 flow [2024-11-08 18:01:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:01:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:01:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-08 18:01:12,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2024-11-08 18:01:12,275 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 113 transitions. [2024-11-08 18:01:12,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 223 flow [2024-11-08 18:01:12,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-08 18:01:12,286 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-11-08 18:01:12,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-08 18:01:12,297 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-11-08 18:01:12,298 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-11-08 18:01:12,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:12,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:12,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:01:12,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1817135854, now seen corresponding path program 1 times [2024-11-08 18:01:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15547853] [2024-11-08 18:01:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15547853] [2024-11-08 18:01:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15547853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:12,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:12,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:01:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590051507] [2024-11-08 18:01:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:12,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:01:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:01:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:01:12,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-08 18:01:12,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:12,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:12,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-08 18:01:12,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:16,172 INFO L124 PetriNetUnfolderBase]: 7779/12155 cut-off events. [2024-11-08 18:01:16,173 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-11-08 18:01:16,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23571 conditions, 12155 events. 7779/12155 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 86858 event pairs, 1033 based on Foata normal form. 400/12112 useless extension candidates. Maximal degree in co-relation 23561. Up to 5841 conditions per place. [2024-11-08 18:01:16,304 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 52 selfloop transitions, 6 changer transitions 1/73 dead transitions. [2024-11-08 18:01:16,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 286 flow [2024-11-08 18:01:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:01:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 18:01:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-08 18:01:16,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2024-11-08 18:01:16,311 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 4 states and 133 transitions. [2024-11-08 18:01:16,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 286 flow [2024-11-08 18:01:16,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:01:16,318 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 132 flow [2024-11-08 18:01:16,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-08 18:01:16,319 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-08 18:01:16,320 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 132 flow [2024-11-08 18:01:16,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:16,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:16,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:16,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:01:16,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:16,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1326785782, now seen corresponding path program 1 times [2024-11-08 18:01:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:16,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813874090] [2024-11-08 18:01:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813874090] [2024-11-08 18:01:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813874090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:01:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638828963] [2024-11-08 18:01:16,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:01:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:01:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:01:16,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-08 18:01:16,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:16,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:16,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-08 18:01:16,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:19,472 INFO L124 PetriNetUnfolderBase]: 6075/9455 cut-off events. [2024-11-08 18:01:19,473 INFO L125 PetriNetUnfolderBase]: For 2240/2240 co-relation queries the response was YES. [2024-11-08 18:01:19,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21239 conditions, 9455 events. 6075/9455 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 63538 event pairs, 451 based on Foata normal form. 364/9502 useless extension candidates. Maximal degree in co-relation 21227. Up to 3681 conditions per place. [2024-11-08 18:01:19,599 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 67 selfloop transitions, 10 changer transitions 1/92 dead transitions. [2024-11-08 18:01:19,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 411 flow [2024-11-08 18:01:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:01:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:01:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-08 18:01:19,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-11-08 18:01:19,606 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 132 flow. Second operand 5 states and 170 transitions. [2024-11-08 18:01:19,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 411 flow [2024-11-08 18:01:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 400 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-08 18:01:19,620 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow [2024-11-08 18:01:19,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-08 18:01:19,621 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-11-08 18:01:19,622 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow [2024-11-08 18:01:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:19,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:19,623 INFO L204 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] [2024-11-08 18:01:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:01:19,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:19,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -52913107, now seen corresponding path program 1 times [2024-11-08 18:01:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364572698] [2024-11-08 18:01:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364572698] [2024-11-08 18:01:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364572698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:20,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:01:20,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626130341] [2024-11-08 18:01:20,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:20,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:01:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:20,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:01:20,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:01:20,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-08 18:01:20,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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) [2024-11-08 18:01:20,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:20,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-08 18:01:20,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:22,187 INFO L124 PetriNetUnfolderBase]: 4027/6103 cut-off events. [2024-11-08 18:01:22,188 INFO L125 PetriNetUnfolderBase]: For 4494/4494 co-relation queries the response was YES. [2024-11-08 18:01:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15553 conditions, 6103 events. 4027/6103 cut-off events. For 4494/4494 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 35660 event pairs, 289 based on Foata normal form. 244/6178 useless extension candidates. Maximal degree in co-relation 15539. Up to 1788 conditions per place. [2024-11-08 18:01:22,236 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 80 selfloop transitions, 14 changer transitions 1/109 dead transitions. [2024-11-08 18:01:22,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 542 flow [2024-11-08 18:01:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:01:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:01:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-11-08 18:01:22,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7118055555555556 [2024-11-08 18:01:22,240 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 6 states and 205 transitions. [2024-11-08 18:01:22,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 542 flow [2024-11-08 18:01:22,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 109 transitions, 512 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-08 18:01:22,282 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 234 flow [2024-11-08 18:01:22,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2024-11-08 18:01:22,283 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-08 18:01:22,283 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 234 flow [2024-11-08 18:01:22,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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) [2024-11-08 18:01:22,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:22,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:22,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:01:22,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:22,293 INFO L85 PathProgramCache]: Analyzing trace with hash 309191648, now seen corresponding path program 1 times [2024-11-08 18:01:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:22,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541284794] [2024-11-08 18:01:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541284794] [2024-11-08 18:01:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541284794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:22,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:01:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714123586] [2024-11-08 18:01:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:22,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:01:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:01:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:01:22,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-08 18:01:22,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:22,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:22,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-08 18:01:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:23,904 INFO L124 PetriNetUnfolderBase]: 2863/4151 cut-off events. [2024-11-08 18:01:23,905 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2024-11-08 18:01:23,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11578 conditions, 4151 events. 2863/4151 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21651 event pairs, 231 based on Foata normal form. 96/4158 useless extension candidates. Maximal degree in co-relation 11563. Up to 1316 conditions per place. [2024-11-08 18:01:23,941 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 71 selfloop transitions, 18 changer transitions 1/104 dead transitions. [2024-11-08 18:01:23,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 532 flow [2024-11-08 18:01:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:01:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:01:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-11-08 18:01:23,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2024-11-08 18:01:23,944 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 234 flow. Second operand 7 states and 218 transitions. [2024-11-08 18:01:23,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 532 flow [2024-11-08 18:01:23,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 486 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-08 18:01:23,990 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 244 flow [2024-11-08 18:01:23,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-11-08 18:01:23,992 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-08 18:01:23,992 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 244 flow [2024-11-08 18:01:23,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:23,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:23,993 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:23,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:01:23,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash 862025333, now seen corresponding path program 1 times [2024-11-08 18:01:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:23,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858025769] [2024-11-08 18:01:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858025769] [2024-11-08 18:01:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858025769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:01:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529299259] [2024-11-08 18:01:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:27,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:01:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:01:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:01:27,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-08 18:01:27,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 244 flow. Second operand has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:27,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:27,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-08 18:01:27,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:29,722 INFO L124 PetriNetUnfolderBase]: 5763/8937 cut-off events. [2024-11-08 18:01:29,722 INFO L125 PetriNetUnfolderBase]: For 3784/4033 co-relation queries the response was YES. [2024-11-08 18:01:29,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21092 conditions, 8937 events. 5763/8937 cut-off events. For 3784/4033 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 55197 event pairs, 1368 based on Foata normal form. 16/8702 useless extension candidates. Maximal degree in co-relation 21076. Up to 2374 conditions per place. [2024-11-08 18:01:29,838 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 87 selfloop transitions, 18 changer transitions 16/146 dead transitions. [2024-11-08 18:01:29,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 146 transitions, 706 flow [2024-11-08 18:01:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:01:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:01:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2024-11-08 18:01:29,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-11-08 18:01:29,842 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 244 flow. Second operand 10 states and 292 transitions. [2024-11-08 18:01:29,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 146 transitions, 706 flow [2024-11-08 18:01:29,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 146 transitions, 600 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-08 18:01:29,970 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 272 flow [2024-11-08 18:01:29,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-11-08 18:01:29,972 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2024-11-08 18:01:29,972 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 272 flow [2024-11-08 18:01:29,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:29,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:29,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:29,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:01:29,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:29,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1958009335, now seen corresponding path program 2 times [2024-11-08 18:01:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:29,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884373251] [2024-11-08 18:01:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:30,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884373251] [2024-11-08 18:01:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884373251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:30,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:01:30,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453300544] [2024-11-08 18:01:30,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:30,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:01:30,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:01:30,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:01:30,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:01:30,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:30,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:30,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:01:30,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:33,760 INFO L124 PetriNetUnfolderBase]: 9915/15147 cut-off events. [2024-11-08 18:01:33,760 INFO L125 PetriNetUnfolderBase]: For 11073/11126 co-relation queries the response was YES. [2024-11-08 18:01:33,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39324 conditions, 15147 events. 9915/15147 cut-off events. For 11073/11126 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 101174 event pairs, 1080 based on Foata normal form. 27/14543 useless extension candidates. Maximal degree in co-relation 39306. Up to 5602 conditions per place. [2024-11-08 18:01:33,970 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 69 selfloop transitions, 26 changer transitions 12/131 dead transitions. [2024-11-08 18:01:33,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 131 transitions, 735 flow [2024-11-08 18:01:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:01:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:01:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-11-08 18:01:33,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-11-08 18:01:33,974 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 272 flow. Second operand 7 states and 198 transitions. [2024-11-08 18:01:33,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 131 transitions, 735 flow [2024-11-08 18:01:33,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 724 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-08 18:01:34,001 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 500 flow [2024-11-08 18:01:34,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2024-11-08 18:01:34,003 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2024-11-08 18:01:34,003 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 500 flow [2024-11-08 18:01:34,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:34,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:34,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:34,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:01:34,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -662814159, now seen corresponding path program 3 times [2024-11-08 18:01:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240218774] [2024-11-08 18:01:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240218774] [2024-11-08 18:01:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240218774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:01:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:01:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:01:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763731077] [2024-11-08 18:01:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:01:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:01:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:01:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:01:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:01:34,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2024-11-08 18:01:34,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:34,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:01:34,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2024-11-08 18:01:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:01:38,461 INFO L124 PetriNetUnfolderBase]: 13477/20532 cut-off events. [2024-11-08 18:01:38,462 INFO L125 PetriNetUnfolderBase]: For 34663/35105 co-relation queries the response was YES. [2024-11-08 18:01:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60061 conditions, 20532 events. 13477/20532 cut-off events. For 34663/35105 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 144391 event pairs, 1796 based on Foata normal form. 113/19776 useless extension candidates. Maximal degree in co-relation 60039. Up to 9366 conditions per place. [2024-11-08 18:01:38,621 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 61 selfloop transitions, 29 changer transitions 47/162 dead transitions. [2024-11-08 18:01:38,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 1175 flow [2024-11-08 18:01:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:01:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 18:01:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2024-11-08 18:01:38,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6011904761904762 [2024-11-08 18:01:38,624 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 500 flow. Second operand 7 states and 202 transitions. [2024-11-08 18:01:38,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 162 transitions, 1175 flow [2024-11-08 18:01:38,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 162 transitions, 1169 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-08 18:01:38,710 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 667 flow [2024-11-08 18:01:38,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2024-11-08 18:01:38,711 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places. [2024-11-08 18:01:38,712 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 667 flow [2024-11-08 18:01:38,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:38,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:01:38,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:01:38,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-08 18:01:38,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1426652265, now seen corresponding path program 4 times [2024-11-08 18:01:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340987336] [2024-11-08 18:01:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:01:38,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:01:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:01:39,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:01:39,193 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:01:39,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-08 18:01:39,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-08 18:01:39,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-08 18:01:39,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-08 18:01:39,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-08 18:01:39,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-08 18:01:39,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-08 18:01:39,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:01:39,201 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-08 18:01:39,368 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:01:39,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:01:39,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:01:39 BasicIcfg [2024-11-08 18:01:39,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:01:39,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:01:39,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:01:39,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:01:39,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:09" (3/4) ... [2024-11-08 18:01:39,380 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 18:01:39,585 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:01:39,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:01:39,590 INFO L158 Benchmark]: Toolchain (without parser) took 33207.41ms. Allocated memory was 130.0MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 64.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 627.9MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,591 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:01:39,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1004.95ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 64.6MB in the beginning and 123.4MB in the end (delta: -58.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.81ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 120.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,592 INFO L158 Benchmark]: Boogie Preprocessor took 141.18ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,593 INFO L158 Benchmark]: RCFGBuilder took 1532.89ms. Allocated memory is still 178.3MB. Free memory was 117.1MB in the beginning and 95.4MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,593 INFO L158 Benchmark]: TraceAbstraction took 30211.60ms. Allocated memory was 178.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 95.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 591.8MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,594 INFO L158 Benchmark]: Witness Printer took 211.86ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:01:39,597 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.40ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1004.95ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 64.6MB in the beginning and 123.4MB in the end (delta: -58.8MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.81ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 120.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.18ms. Allocated memory is still 178.3MB. Free memory was 120.2MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1532.89ms. Allocated memory is still 178.3MB. Free memory was 117.1MB in the beginning and 95.4MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30211.60ms. Allocated memory was 178.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 95.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 591.8MB. Max. memory is 16.1GB. * Witness Printer took 211.86ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L763] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353=-1, t1354=0, t1355=1, t1356=2, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 864]: 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: 862]: 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: 866]: 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 9 procedures, 81 locations, 7 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: 29.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 41 mSDtfsCounter, 1291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=667occurred in iteration=8, InterpolantAutomatonStates: 49, 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, 1.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2024-11-08 18:01:39,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12ed2891-5ce9-484b-83c2-1d84388c121e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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