./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-ghost/safe011_power.opt_pso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i ./goblint.2024-08-08_07-59-58.files/protection-ghost/safe011_power.opt_pso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 05:41:00,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 05:41:00,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 05:41:00,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 05:41:00,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 05:41:00,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 05:41:00,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 05:41:00,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 05:41:00,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 05:41:00,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 05:41:00,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 05:41:00,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 05:41:00,579 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 05:41:00,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 05:41:00,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 05:41:00,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 05:41:00,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 05:41:00,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 05:41:00,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 05:41:00,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 05:41:00,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 05:41:00,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 05:41:00,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 05:41:00,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 05:41:00,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 05:41:00,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 05:41:00,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 05:41:00,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 05:41:00,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 05:41:00,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 05:41:00,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 05:41:00,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 05:41:00,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 05:41:00,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 05:41:00,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 05:41:00,591 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 05:41:00,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 05:41:00,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 05:41:00,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 05:41:00,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 05:41:00,593 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 05:41:00,593 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 05:41:00,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-14 05:41:00,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 05:41:00,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 05:41:00,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 05:41:00,869 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 05:41:00,870 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 05:41:00,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-ghost/safe011_power.opt_pso.opt.yml/witness.yml [2024-08-14 05:41:01,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 05:41:01,055 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 05:41:01,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2024-08-14 05:41:02,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 05:41:02,728 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 05:41:02,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2024-08-14 05:41:02,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ab01c82d9/3de93093a0264739b52de66c57b7718e/FLAGd6d9dba70 [2024-08-14 05:41:02,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ab01c82d9/3de93093a0264739b52de66c57b7718e [2024-08-14 05:41:02,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 05:41:02,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 05:41:02,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 05:41:02,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 05:41:02,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 05:41:02,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 05:41:01" (1/2) ... [2024-08-14 05:41:02,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb68a6f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 05:41:02, skipping insertion in model container [2024-08-14 05:41:02,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 05:41:01" (1/2) ... [2024-08-14 05:41:02,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@791a19cb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 05:41:02, skipping insertion in model container [2024-08-14 05:41:02,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 05:41:02" (2/2) ... [2024-08-14 05:41:02,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb68a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:02, skipping insertion in model container [2024-08-14 05:41:02,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 05:41:02" (2/2) ... [2024-08-14 05:41:02,799 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-14 05:41:02,898 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 05:41:02,901 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] ((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) [2024-08-14 05:41:02,901 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] ((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) [2024-08-14 05:41:02,901 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) [2024-08-14 05:41:02,901 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-14 05:41:02,901 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-08-14 05:41:02,935 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 05:41:03,063 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2024-08-14 05:41:03,201 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 05:41:03,222 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-14 05:41:03,257 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-14 05:41:03,318 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 05:41:03,347 INFO L206 MainTranslator]: Completed translation [2024-08-14 05:41:03,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03 WrapperNode [2024-08-14 05:41:03,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 05:41:03,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 05:41:03,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 05:41:03,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 05:41:03,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,404 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-08-14 05:41:03,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 05:41:03,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 05:41:03,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 05:41:03,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 05:41:03,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 05:41:03,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 05:41:03,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 05:41:03,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 05:41:03,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (1/1) ... [2024-08-14 05:41:03,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 05:41:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 05:41:03,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-14 05:41:03,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-14 05:41:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-14 05:41:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 05:41:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-14 05:41:03,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-14 05:41:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-14 05:41:03,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-14 05:41:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-08-14 05:41:03,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-08-14 05:41:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 05:41:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-14 05:41:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 05:41:03,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 05:41:03,502 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 05:41:03,603 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 05:41:03,605 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 05:41:03,854 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 05:41:03,854 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 05:41:04,037 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 05:41:04,038 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 05:41:04,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 05:41:04 BoogieIcfgContainer [2024-08-14 05:41:04,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 05:41:04,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 05:41:04,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 05:41:04,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 05:41:04,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 05:41:01" (1/4) ... [2024-08-14 05:41:04,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733560e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 05:41:04, skipping insertion in model container [2024-08-14 05:41:04,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 05:41:02" (2/4) ... [2024-08-14 05:41:04,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733560e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 05:41:04, skipping insertion in model container [2024-08-14 05:41:04,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 05:41:03" (3/4) ... [2024-08-14 05:41:04,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733560e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 05:41:04, skipping insertion in model container [2024-08-14 05:41:04,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 05:41:04" (4/4) ... [2024-08-14 05:41:04,048 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-08-14 05:41:04,066 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 05:41:04,067 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-08-14 05:41:04,067 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 05:41:04,117 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 05:41:04,159 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 05:41:04,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 05:41:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 05:41:04,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 05:41:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-14 05:41:04,207 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 05:41:04,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 05:41:04,224 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@5d63c7af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 05:41:04,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-08-14 05:41:04,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:04,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 351296548, now seen corresponding path program 1 times [2024-08-14 05:41:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121381678] [2024-08-14 05:41:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121381678] [2024-08-14 05:41:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121381678] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-14 05:41:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333040354] [2024-08-14 05:41:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:05,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 05:41:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 05:41:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 05:41:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:05,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:05,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08-14 05:41:05,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:05,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 05:41:05,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:05,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash -757759445, now seen corresponding path program 1 times [2024-08-14 05:41:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579298341] [2024-08-14 05:41:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:05,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579298341] [2024-08-14 05:41:05,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579298341] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:05,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:05,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 05:41:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805935090] [2024-08-14 05:41:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 05:41:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 05:41:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 05:41:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:05,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:05,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-08-14 05:41:05,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:05,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:05,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 05:41:05,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:05,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 436491182, now seen corresponding path program 1 times [2024-08-14 05:41:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:05,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613860120] [2024-08-14 05:41:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613860120] [2024-08-14 05:41:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613860120] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 05:41:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561120849] [2024-08-14 05:41:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 05:41:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 05:41:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-08-14 05:41:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:07,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:07,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-08-14 05:41:07,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:07,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:07,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:07,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 05:41:07,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:07,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1666815646, now seen corresponding path program 1 times [2024-08-14 05:41:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438125402] [2024-08-14 05:41:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438125402] [2024-08-14 05:41:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438125402] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 05:41:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954606339] [2024-08-14 05:41:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:09,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 05:41:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 05:41:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-08-14 05:41:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:09,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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-08-14 05:41:09,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:09,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:09,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 05:41:09,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:09,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2121854326, now seen corresponding path program 1 times [2024-08-14 05:41:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464228181] [2024-08-14 05:41:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464228181] [2024-08-14 05:41:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464228181] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 05:41:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341497099] [2024-08-14 05:41:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:09,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 05:41:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:09,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 05:41:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-08-14 05:41:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:09,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:09,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-08-14 05:41:09,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:09,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:09,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:09,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:10,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 05:41:10,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:10,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1709211019, now seen corresponding path program 1 times [2024-08-14 05:41:10,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649111827] [2024-08-14 05:41:10,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:10,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649111827] [2024-08-14 05:41:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649111827] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:10,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:10,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-14 05:41:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383864389] [2024-08-14 05:41:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:10,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 05:41:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:10,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 05:41:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-14 05:41:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:10,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:10,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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-08-14 05:41:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:10,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:10,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:10,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 05:41:10,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:10,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 174873368, now seen corresponding path program 1 times [2024-08-14 05:41:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628344449] [2024-08-14 05:41:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628344449] [2024-08-14 05:41:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628344449] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:11,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 05:41:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560838214] [2024-08-14 05:41:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 05:41:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 05:41:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-08-14 05:41:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:11,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:11,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:11,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:12,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 05:41:12,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:12,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1778895776, now seen corresponding path program 1 times [2024-08-14 05:41:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:12,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797031833] [2024-08-14 05:41:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797031833] [2024-08-14 05:41:12,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797031833] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:12,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 05:41:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834184132] [2024-08-14 05:41:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 05:41:12,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:12,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 05:41:12,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-08-14 05:41:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:12,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:12,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:12,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:13,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 05:41:13,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:13,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -409665415, now seen corresponding path program 1 times [2024-08-14 05:41:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448104922] [2024-08-14 05:41:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448104922] [2024-08-14 05:41:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448104922] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-14 05:41:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931866334] [2024-08-14 05:41:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:14,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 05:41:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:14,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 05:41:14,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-08-14 05:41:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:14,228 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:14,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:14,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:14,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:14,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:14,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:14,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-14 05:41:14,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:14,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash -705953201, now seen corresponding path program 1 times [2024-08-14 05:41:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711089136] [2024-08-14 05:41:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:15,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711089136] [2024-08-14 05:41:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711089136] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-14 05:41:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999597697] [2024-08-14 05:41:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:15,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 05:41:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 05:41:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-08-14 05:41:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:15,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:15,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-08-14 05:41:15,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:15,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:15,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-14 05:41:16,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:16,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2077884125, now seen corresponding path program 1 times [2024-08-14 05:41:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389884554] [2024-08-14 05:41:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389884554] [2024-08-14 05:41:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389884554] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 05:41:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657197391] [2024-08-14 05:41:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-14 05:41:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-14 05:41:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-08-14 05:41:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:17,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:17,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:17,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:17,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:17,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:17,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:17,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:17,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-14 05:41:18,157 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:18,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1422093281, now seen corresponding path program 1 times [2024-08-14 05:41:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074509830] [2024-08-14 05:41:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074509830] [2024-08-14 05:41:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074509830] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:18,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-14 05:41:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801251138] [2024-08-14 05:41:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:18,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-14 05:41:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-14 05:41:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-08-14 05:41:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:18,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:18,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:18,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:18,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 05:41:19,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 05:41:19,354 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:19,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash 649316571, now seen corresponding path program 1 times [2024-08-14 05:41:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938218366] [2024-08-14 05:41:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 05:41:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 05:41:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 05:41:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938218366] [2024-08-14 05:41:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938218366] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 05:41:20,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 05:41:20,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-14 05:41:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136355895] [2024-08-14 05:41:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 05:41:20,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 05:41:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 05:41:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 05:41:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-08-14 05:41:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:20,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 05:41:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 05:41:20,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 05:41:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 05:41:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 05:41:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 05:41:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 05:41:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-14 05:41:21,181 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-14 05:41:21,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 05:41:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash 472220294, now seen corresponding path program 2 times [2024-08-14 05:41:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 05:41:21,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706709330] [2024-08-14 05:41:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 05:41:21,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 05:41:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 05:41:21,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 05:41:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 05:41:21,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 05:41:21,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 05:41:21,284 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-08-14 05:41:21,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-08-14 05:41:21,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-08-14 05:41:21,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-08-14 05:41:21,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-08-14 05:41:21,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-08-14 05:41:21,290 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-08-14 05:41:21,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-14 05:41:21,295 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-14 05:41:21,298 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-08-14 05:41:21,301 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-14 05:41:21,301 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 05:41:21,378 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-08-14 05:41:21,378 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-08-14 05:41:21,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 05:41:21 BasicIcfg [2024-08-14 05:41:21,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 05:41:21,380 INFO L158 Benchmark]: Toolchain (without parser) took 18599.50ms. Allocated memory was 207.6MB in the beginning and 702.5MB in the end (delta: 494.9MB). Free memory was 125.6MB in the beginning and 544.9MB in the end (delta: -419.3MB). Peak memory consumption was 77.1MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,380 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 207.6MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 05:41:21,380 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 207.6MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 05:41:21,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.73ms. Allocated memory is still 207.6MB. Free memory was 125.4MB in the beginning and 144.7MB in the end (delta: -19.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.63ms. Allocated memory is still 207.6MB. Free memory was 144.7MB in the beginning and 141.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,380 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 207.6MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,381 INFO L158 Benchmark]: RCFGBuilder took 607.00ms. Allocated memory is still 207.6MB. Free memory was 139.5MB in the beginning and 80.8MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,381 INFO L158 Benchmark]: TraceAbstraction took 17338.15ms. Allocated memory was 207.6MB in the beginning and 702.5MB in the end (delta: 494.9MB). Free memory was 80.8MB in the beginning and 544.9MB in the end (delta: -464.2MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-08-14 05:41:21,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 207.6MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.17ms. Allocated memory is still 207.6MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.73ms. Allocated memory is still 207.6MB. Free memory was 125.4MB in the beginning and 144.7MB in the end (delta: -19.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.63ms. Allocated memory is still 207.6MB. Free memory was 144.7MB in the beginning and 141.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 207.6MB. Free memory was 141.6MB in the beginning and 139.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.00ms. Allocated memory is still 207.6MB. Free memory was 139.5MB in the beginning and 80.8MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17338.15ms. Allocated memory was 207.6MB in the beginning and 702.5MB in the end (delta: 494.9MB). Free memory was 80.8MB in the beginning and 544.9MB in the end (delta: -464.2MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9242, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 373, dependent conditional: 307, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9050, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 181, dependent conditional: 115, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9050, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 181, dependent conditional: 115, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 1410, dependent unconditional: 1030, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 808, dependent unconditional: 1632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 808, dependent unconditional: 1632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 840, independent: 678, independent conditional: 57, independent unconditional: 621, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 840, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 263, independent: 101, independent conditional: 57, independent unconditional: 44, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 263, independent: 101, independent conditional: 57, independent unconditional: 44, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1103, independent: 441, independent conditional: 218, independent unconditional: 223, dependent: 661, dependent conditional: 366, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11309, independent: 8191, independent conditional: 792, independent unconditional: 7399, dependent: 2278, dependent conditional: 712, dependent unconditional: 1566, unknown: 840, unknown conditional: 153, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 678, Positive conditional cache size: 57, Positive unconditional cache size: 621, Negative cache size: 162, Negative conditional cache size: 96, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 602, Maximal queried relation: 7, Independence queries for same thread: 192 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 461, Number of trivial persistent sets: 290, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9242, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 373, dependent conditional: 307, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9050, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 181, dependent conditional: 115, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9050, independent: 8869, independent conditional: 8255, independent unconditional: 614, dependent: 181, dependent conditional: 115, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 1410, dependent unconditional: 1030, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 808, dependent unconditional: 1632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11309, independent: 8869, independent conditional: 849, independent unconditional: 8020, dependent: 2440, dependent conditional: 808, dependent unconditional: 1632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 840, independent: 678, independent conditional: 57, independent unconditional: 621, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 840, independent: 577, independent conditional: 0, independent unconditional: 577, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 263, independent: 101, independent conditional: 57, independent unconditional: 44, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 263, independent: 101, independent conditional: 57, independent unconditional: 44, dependent: 162, dependent conditional: 96, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1103, independent: 441, independent conditional: 218, independent unconditional: 223, dependent: 661, dependent conditional: 366, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11309, independent: 8191, independent conditional: 792, independent unconditional: 7399, dependent: 2278, dependent conditional: 712, dependent unconditional: 1566, unknown: 840, unknown conditional: 153, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 678, Positive conditional cache size: 57, Positive unconditional cache size: 621, Negative cache size: 162, Negative conditional cache size: 96, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 602, Maximal queried relation: 7, Independence queries for same thread: 192 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L821] 0 //@ assert (((((((((((((((((!multithreaded || (x$r_buff1_thd3 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((z == 0) || (z == 1)) || (z == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))); [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 0 pthread_t t2030; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L823] 0 //@ assert (((((((((((((((((!multithreaded || (x$r_buff1_thd3 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((z == 0) || (z == 1)) || (z == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))); [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 return 0; [L824] 0 //@ assert (((((((((((((((((!multithreaded || (x$r_buff1_thd3 == (_Bool) 0)) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (((z == 0) || (z == 1)) || (z == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L785] 2 return 0; [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 821]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 71 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 6.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 10532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-08-14 05:41:21,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-08-14 05:41:21,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE