./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-20_10-08-36.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f 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/goblint-regression/28-race_reach_12-ptr_racefree.i ./goblint.2024-08-20_10-08-36.files/protection-local/28-race_reach_12-ptr_racefree.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.dk.goblint-eval-da67795-m [2024-08-27 13:29:07,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 13:29:07,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 13:29:07,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 13:29:07,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 13:29:07,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 13:29:07,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 13:29:07,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 13:29:07,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 13:29:07,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 13:29:07,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 13:29:07,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 13:29:07,469 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 13:29:07,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 13:29:07,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 13:29:07,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 13:29:07,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 13:29:07,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 13:29:07,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 13:29:07,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 13:29:07,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 13:29:07,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 13:29:07,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 13:29:07,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 13:29:07,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 13:29:07,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 13:29:07,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 13:29:07,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 13:29:07,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 13:29:07,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 13:29:07,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 13:29:07,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 13:29:07,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 13:29:07,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 13:29:07,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 13:29:07,479 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 13:29:07,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 13:29:07,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 13:29:07,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 13:29:07,482 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 13:29:07,482 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 13:29:07,483 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 13:29:07,483 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-27 13:29:07,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 13:29:07,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 13:29:07,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 13:29:07,766 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 13:29:07,767 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 13:29:07,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml [2024-08-27 13:29:07,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 13:29:07,864 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 13:29:07,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-08-27 13:29:09,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 13:29:09,519 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 13:29:09,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-08-27 13:29:09,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f475b5c20/a708063aee524c339e815dc0c6099d7d/FLAGb957d59eb [2024-08-27 13:29:09,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f475b5c20/a708063aee524c339e815dc0c6099d7d [2024-08-27 13:29:09,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 13:29:09,558 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 13:29:09,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 13:29:09,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 13:29:09,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 13:29:09,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:29:07" (1/2) ... [2024-08-27 13:29:09,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2547677 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:29:09, skipping insertion in model container [2024-08-27 13:29:09,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:29:07" (1/2) ... [2024-08-27 13:29:09,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@403ded90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:29:09, skipping insertion in model container [2024-08-27 13:29:09,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:29:09" (2/2) ... [2024-08-27 13:29:09,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2547677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:09, skipping insertion in model container [2024-08-27 13:29:09,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:29:09" (2/2) ... [2024-08-27 13:29:09,569 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 13:29:09,592 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 13:29:09,593 INFO L1541 ArrayList]: Location invariant before [L703-L703] 0 <= global [2024-08-27 13:29:09,593 INFO L1541 ArrayList]: Location invariant before [L703-L703] 1 <= global [2024-08-27 13:29:09,594 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-08-27 13:29:09,594 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-08-27 13:29:09,638 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 13:29:09,963 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2024-08-27 13:29:09,994 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 13:29:10,006 INFO L202 MainTranslator]: Completed pre-run [2024-08-27 13:29:10,057 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-27 13:29:10,087 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 13:29:10,120 INFO L206 MainTranslator]: Completed translation [2024-08-27 13:29:10,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10 WrapperNode [2024-08-27 13:29:10,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 13:29:10,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 13:29:10,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 13:29:10,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 13:29:10,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,160 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-08-27 13:29:10,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 13:29:10,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 13:29:10,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 13:29:10,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 13:29:10,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 13:29:10,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 13:29:10,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 13:29:10,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 13:29:10,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (1/1) ... [2024-08-27 13:29:10,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 13:29:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:10,225 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-27 13:29:10,228 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-27 13:29:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-27 13:29:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-27 13:29:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-08-27 13:29:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-27 13:29:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 13:29:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 13:29:10,264 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 13:29:10,386 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 13:29:10,388 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 13:29:10,601 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 13:29:10,602 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 13:29:10,783 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 13:29:10,784 INFO L318 CfgBuilder]: Removed 10 assume(true) statements. [2024-08-27 13:29:10,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:29:10 BoogieIcfgContainer [2024-08-27 13:29:10,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 13:29:10,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 13:29:10,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 13:29:10,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 13:29:10,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:29:07" (1/4) ... [2024-08-27 13:29:10,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775eb77d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:29:10, skipping insertion in model container [2024-08-27 13:29:10,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:29:09" (2/4) ... [2024-08-27 13:29:10,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775eb77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:29:10, skipping insertion in model container [2024-08-27 13:29:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:29:10" (3/4) ... [2024-08-27 13:29:10,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775eb77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:29:10, skipping insertion in model container [2024-08-27 13:29:10,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:29:10" (4/4) ... [2024-08-27 13:29:10,792 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-08-27 13:29:10,807 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 13:29:10,807 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-08-27 13:29:10,807 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 13:29:10,853 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-08-27 13:29:10,893 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:10,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:10,896 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-27 13:29:10,898 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-27 13:29:10,931 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:10,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-08-27 13:29:10,954 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:10,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:29:11,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:11,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2082627238, now seen corresponding path program 1 times [2024-08-27 13:29:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741702033] [2024-08-27 13:29:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:29:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741702033] [2024-08-27 13:29:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741702033] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:11,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:11,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897836834] [2024-08-27 13:29:11,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:11,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:29:11,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:29:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:29:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:11,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:11,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-27 13:29:11,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:11,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 13:29:11,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:11,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -344275208, now seen corresponding path program 1 times [2024-08-27 13:29:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821468986] [2024-08-27 13:29:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821468986] [2024-08-27 13:29:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821468986] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806283431] [2024-08-27 13:29:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:11,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:11,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:11,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-27 13:29:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:11,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-27 13:29:11,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:11,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:11,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:12,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:12,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:12,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806283431] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:12,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2024-08-27 13:29:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802568230] [2024-08-27 13:29:12,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:12,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 13:29:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 13:29:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=33, Unknown=2, NotChecked=0, Total=56 [2024-08-27 13:29:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:12,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-27 13:29:12,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:12,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-27 13:29:12,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-27 13:29:12,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:12,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:12,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1521507440, now seen corresponding path program 1 times [2024-08-27 13:29:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:12,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750209114] [2024-08-27 13:29:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750209114] [2024-08-27 13:29:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750209114] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:29:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385915135] [2024-08-27 13:29:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:29:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,752 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:12,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-27 13:29:12,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:12,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:12,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:29:13,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-27 13:29:13,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:13,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -21435472, now seen corresponding path program 2 times [2024-08-27 13:29:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017561103] [2024-08-27 13:29:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017561103] [2024-08-27 13:29:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017561103] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112422454] [2024-08-27 13:29:13,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 13:29:13,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:13,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:13,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-27 13:29:13,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 13:29:13,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:29:13,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-27 13:29:13,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:13,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:13,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:13,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:29:13,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:13,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:14,009 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_82 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_82) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:29:14,079 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-08-27 13:29:14,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 53 [2024-08-27 13:29:14,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:29:14,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-08-27 13:29:14,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 13:29:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-08-27 13:29:14,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112422454] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:14,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:14,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2024-08-27 13:29:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265024734] [2024-08-27 13:29:14,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-27 13:29:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-27 13:29:14,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2024-08-27 13:29:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,223 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:14,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-27 13:29:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:29:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:29:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:14,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-27 13:29:14,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-27 13:29:14,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-27 13:29:14,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:14,768 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-08-27 13:29:14,769 INFO L308 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE (1/2) [2024-08-27 13:29:14,774 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:14,776 INFO L229 MonitoredProcess]: Starting monitored process 5 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-27 13:29:14,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-08-27 13:29:14,781 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:14,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:29:14,782 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:14,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:29:14,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:14,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -288132235, now seen corresponding path program 1 times [2024-08-27 13:29:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073044974] [2024-08-27 13:29:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073044974] [2024-08-27 13:29:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073044974] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:14,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726236863] [2024-08-27 13:29:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:14,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:29:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:29:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:29:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,851 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:14,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:29:14,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:14,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-27 13:29:14,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:14,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1055047341, now seen corresponding path program 1 times [2024-08-27 13:29:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872686588] [2024-08-27 13:29:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:14,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:29:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:14,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 13:29:14,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:29:14,906 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:29:14,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:29:14,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:29:14,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:29:14,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 13:29:14,908 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 13:29:14,908 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-08-27 13:29:14,909 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:29:14,909 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 13:29:14,928 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-08-27 13:29:14,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:14,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:14,934 INFO L229 MonitoredProcess]: Starting monitored process 6 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-27 13:29:14,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-27 13:29:14,938 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:14,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-08-27 13:29:14,939 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:14,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:29:15,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:15,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1634440545, now seen corresponding path program 1 times [2024-08-27 13:29:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:15,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059165789] [2024-08-27 13:29:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059165789] [2024-08-27 13:29:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059165789] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:15,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117643041] [2024-08-27 13:29:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:15,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:15,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:15,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-27 13:29:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:15,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 13:29:15,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:15,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -983777725, now seen corresponding path program 1 times [2024-08-27 13:29:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649847112] [2024-08-27 13:29:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649847112] [2024-08-27 13:29:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649847112] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40790507] [2024-08-27 13:29:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:15,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:15,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:15,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:15,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-27 13:29:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:15,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-27 13:29:15,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:15,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:15,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:15,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:15,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:15,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:15,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_138) |c_~#global~0.base|) |c_~#global~0.offset|) 1))) is different from false [2024-08-27 13:29:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-08-27 13:29:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40790507] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:15,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2024-08-27 13:29:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886685691] [2024-08-27 13:29:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:15,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 13:29:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 13:29:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2024-08-27 13:29:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:15,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:15,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-27 13:29:15,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:15,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:15,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:15,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-27 13:29:15,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:15,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:15,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 817742600, now seen corresponding path program 1 times [2024-08-27 13:29:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260721155] [2024-08-27 13:29:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260721155] [2024-08-27 13:29:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260721155] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343316472] [2024-08-27 13:29:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:16,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:16,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-27 13:29:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:16,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:29:16,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:16,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 13:29:16,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 13:29:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 13:29:16,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:16,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:29:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343316472] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 13:29:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-08-27 13:29:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582965611] [2024-08-27 13:29:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:16,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-08-27 13:29:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:16,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:16,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-27 13:29:16,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:16,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:16,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:16,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-27 13:29:16,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-08-27 13:29:16,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:16,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1634917495, now seen corresponding path program 1 times [2024-08-27 13:29:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19214357] [2024-08-27 13:29:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19214357] [2024-08-27 13:29:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19214357] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718040016] [2024-08-27 13:29:16,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:16,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:16,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:16,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-27 13:29:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:17,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-27 13:29:17,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:17,065 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:17,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-08-27 13:29:17,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:17,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:17,270 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_220 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_220) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:29:18,187 INFO L349 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2024-08-27 13:29:18,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 56 [2024-08-27 13:29:18,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:29:18,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2024-08-27 13:29:18,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 13:29:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-08-27 13:29:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718040016] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:18,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-08-27 13:29:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036465383] [2024-08-27 13:29:18,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:18,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-27 13:29:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-27 13:29:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=109, Unknown=2, NotChecked=22, Total=182 [2024-08-27 13:29:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:18,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-27 13:29:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:18,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:18,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:19,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-27 13:29:19,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:19,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:19,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1891748844, now seen corresponding path program 1 times [2024-08-27 13:29:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300523668] [2024-08-27 13:29:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:29:19,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300523668] [2024-08-27 13:29:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300523668] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:19,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157769949] [2024-08-27 13:29:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:19,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:19,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:19,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:19,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-27 13:29:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:19,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:19,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:19,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-27 13:29:19,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:19,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1159976035, now seen corresponding path program 1 times [2024-08-27 13:29:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266139809] [2024-08-27 13:29:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:29:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266139809] [2024-08-27 13:29:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266139809] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484449676] [2024-08-27 13:29:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:19,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:19,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-27 13:29:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:19,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:29:19,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:19,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484449676] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:19,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-08-27 13:29:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552792053] [2024-08-27 13:29:19,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:19,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 13:29:19,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 13:29:19,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-08-27 13:29:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:19,907 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:19,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:19,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:29:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:29:20,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-27 13:29:20,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-27 13:29:20,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-08-27 13:29:20,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:20,347 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-08-27 13:29:20,347 INFO L308 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE,SAFE (1/3) [2024-08-27 13:29:20,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:20,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:20,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:20,351 INFO L229 MonitoredProcess]: Starting monitored process 11 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-27 13:29:20,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-27 13:29:20,355 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:20,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:29:20,356 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:20,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:29:20,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:20,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 194378609, now seen corresponding path program 1 times [2024-08-27 13:29:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243731355] [2024-08-27 13:29:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:29:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243731355] [2024-08-27 13:29:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243731355] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432360223] [2024-08-27 13:29:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:29:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:29:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:29:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:20,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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-27 13:29:20,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-27 13:29:20,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2097391505, now seen corresponding path program 1 times [2024-08-27 13:29:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992781946] [2024-08-27 13:29:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:20,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992781946] [2024-08-27 13:29:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992781946] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:20,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:20,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27481188] [2024-08-27 13:29:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:20,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:20,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,527 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:20,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-27 13:29:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-27 13:29:20,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:20,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:20,554 INFO L85 PathProgramCache]: Analyzing trace with hash -517574246, now seen corresponding path program 1 times [2024-08-27 13:29:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310932465] [2024-08-27 13:29:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:29:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310932465] [2024-08-27 13:29:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310932465] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651854651] [2024-08-27 13:29:20,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:20,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:20,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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-27 13:29:20,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-27 13:29:20,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:20,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 918822592, now seen corresponding path program 1 times [2024-08-27 13:29:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135402478] [2024-08-27 13:29:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135402478] [2024-08-27 13:29:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135402478] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:29:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578997631] [2024-08-27 13:29:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:29:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:20,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-27 13:29:20,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:20,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-27 13:29:20,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:20,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1532004897, now seen corresponding path program 1 times [2024-08-27 13:29:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953707518] [2024-08-27 13:29:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:20,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:29:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:20,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 13:29:20,900 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:29:20,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:29:20,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:29:20,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:29:20,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:29:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-27 13:29:20,901 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 13:29:20,902 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-08-27 13:29:20,902 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:29:20,902 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 13:29:20,923 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-08-27 13:29:20,925 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:20,927 INFO L229 MonitoredProcess]: Starting monitored process 12 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-27 13:29:20,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-08-27 13:29:20,931 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:20,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:29:20,932 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:20,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:29:21,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:21,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1802919074, now seen corresponding path program 1 times [2024-08-27 13:29:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412453420] [2024-08-27 13:29:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 13:29:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412453420] [2024-08-27 13:29:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412453420] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212428082] [2024-08-27 13:29:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:21,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:29:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:29:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:29:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:21,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-27 13:29:21,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-27 13:29:21,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:21,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1561299360, now seen corresponding path program 1 times [2024-08-27 13:29:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:21,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422410718] [2024-08-27 13:29:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:29:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422410718] [2024-08-27 13:29:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422410718] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:21,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465778054] [2024-08-27 13:29:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:21,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:21,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:21,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:21,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:21,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-27 13:29:21,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-27 13:29:21,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:21,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:21,219 INFO L85 PathProgramCache]: Analyzing trace with hash 168449567, now seen corresponding path program 1 times [2024-08-27 13:29:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526358760] [2024-08-27 13:29:21,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:21,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:29:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526358760] [2024-08-27 13:29:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526358760] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:21,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984114067] [2024-08-27 13:29:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:21,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:21,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:21,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:21,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-27 13:29:21,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-27 13:29:21,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:21,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 851463362, now seen corresponding path program 1 times [2024-08-27 13:29:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925657050] [2024-08-27 13:29:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925657050] [2024-08-27 13:29:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925657050] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127912987] [2024-08-27 13:29:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:21,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:21,681 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:21,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-27 13:29:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:21,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:29:21,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:21,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 13:29:21,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 13:29:21,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:21,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 13:29:21,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:29:21,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:29:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127912987] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 13:29:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-08-27 13:29:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560237010] [2024-08-27 13:29:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:21,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-27 13:29:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:21,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-27 13:29:21,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:22,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-27 13:29:22,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-08-27 13:29:22,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:22,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1573137024, now seen corresponding path program 1 times [2024-08-27 13:29:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710732239] [2024-08-27 13:29:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710732239] [2024-08-27 13:29:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710732239] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033117005] [2024-08-27 13:29:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:22,422 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:22,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-27 13:29:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:22,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-27 13:29:22,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:22,556 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:22,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:22,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:29:22,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:29:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:22,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:22,852 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-08-27 13:29:22,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 53 [2024-08-27 13:29:22,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:29:22,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-08-27 13:29:22,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 13:29:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:29:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033117005] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:29:22,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 13:29:22,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-08-27 13:29:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554602952] [2024-08-27 13:29:22,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 13:29:22,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-27 13:29:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-27 13:29:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=125, Unknown=4, NotChecked=0, Total=182 [2024-08-27 13:29:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:22,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:22,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 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-27 13:29:22,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:22,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:22,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:22,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:22,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:29:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:23,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-27 13:29:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-08-27 13:29:23,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:29:23,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 73433281, now seen corresponding path program 1 times [2024-08-27 13:29:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597916962] [2024-08-27 13:29:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:23,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:29:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:29:23,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 13:29:23,412 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:29:23,413 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:29:23,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:29:23,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:29:23,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:29:23,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-08-27 13:29:23,415 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-08-27 13:29:23,415 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-08-27 13:29:23,416 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:29:23,416 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-27 13:29:23,438 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-08-27 13:29:23,441 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:23,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:29:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:23,443 INFO L229 MonitoredProcess]: Starting monitored process 15 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-27 13:29:23,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-08-27 13:29:23,447 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:29:23,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-08-27 13:29:23,447 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;@5839c734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:29:23,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:29:23,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:23,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 639993504, now seen corresponding path program 1 times [2024-08-27 13:29:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679465895] [2024-08-27 13:29:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 13:29:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679465895] [2024-08-27 13:29:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679465895] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:23,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:29:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496138712] [2024-08-27 13:29:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:29:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:29:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:29:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:23,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-27 13:29:23,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-08-27 13:29:23,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:23,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1578287137, now seen corresponding path program 1 times [2024-08-27 13:29:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807421186] [2024-08-27 13:29:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 13:29:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807421186] [2024-08-27 13:29:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807421186] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:23,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:23,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393483839] [2024-08-27 13:29:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:23,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,824 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:23,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 13:29:23,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:23,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-08-27 13:29:24,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:24,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1403642537, now seen corresponding path program 1 times [2024-08-27 13:29:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663690214] [2024-08-27 13:29:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 13:29:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663690214] [2024-08-27 13:29:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663690214] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:24,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:29:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481825330] [2024-08-27 13:29:24,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:29:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:29:24,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:29:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:24,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:29:24,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-08-27 13:29:24,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:24,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1983358310, now seen corresponding path program 1 times [2024-08-27 13:29:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317429693] [2024-08-27 13:29:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-08-27 13:29:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317429693] [2024-08-27 13:29:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317429693] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:29:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156658573] [2024-08-27 13:29:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:29:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:24,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-27 13:29:24,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:24,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-08-27 13:29:24,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:24,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1416773956, now seen corresponding path program 1 times [2024-08-27 13:29:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969178828] [2024-08-27 13:29:24,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:24,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 13:29:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969178828] [2024-08-27 13:29:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969178828] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:25,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:25,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:29:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297870725] [2024-08-27 13:29:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:25,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:29:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:29:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:29:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:25,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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-27 13:29:25,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:25,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-08-27 13:29:25,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:25,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1515231556, now seen corresponding path program 2 times [2024-08-27 13:29:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147331425] [2024-08-27 13:29:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 13:29:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147331425] [2024-08-27 13:29:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147331425] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:29:25,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:29:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-27 13:29:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184634119] [2024-08-27 13:29:25,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:29:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 13:29:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 13:29:25,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 13:29:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-08-27 13:29:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:29:25,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:29:25,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:25,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:25,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:25,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:29:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:29:26,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-27 13:29:26,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:29:26,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:29:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1862191756, now seen corresponding path program 3 times [2024-08-27 13:29:26,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 13:29:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362066554] [2024-08-27 13:29:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:29:26,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 13:29:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:29:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:29:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 13:29:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362066554] [2024-08-27 13:29:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362066554] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 13:29:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805577783] [2024-08-27 13:29:27,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-27 13:29:27,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:29:27,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:29:27,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 13:29:27,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-27 13:29:27,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-27 13:29:27,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:29:27,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-27 13:29:27,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:29:27,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 13:29:27,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 13:29:28,060 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-08-27 13:29:28,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2024-08-27 13:29:28,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2024-08-27 13:29:28,507 INFO L349 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2024-08-27 13:29:28,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 88 [2024-08-27 13:29:29,179 INFO L349 Elim1Store]: treesize reduction 88, result has 42.9 percent of original size [2024-08-27 13:29:29,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 137 [2024-08-27 13:29:29,870 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-08-27 13:29:29,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 54 [2024-08-27 13:29:30,010 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-08-27 13:29:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 57 [2024-08-27 13:29:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 13:29:30,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:29:37,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.offset Int) (v_ArrVal_1030 Int) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1033 Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (t_funThread3of4ForFork0_~p~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1028))) (let ((.cse5 (select .cse1 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse9 (store .cse1 t_funThread3of4ForFork0_~p~0.base (store .cse5 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1030)))) (let ((.cse6 (select .cse9 c_t_funThread2of4ForFork0_~p~0.base))) (let ((.cse2 (store .cse6 c_t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1032))) (let ((.cse8 (store .cse9 c_t_funThread2of4ForFork0_~p~0.base .cse2))) (let ((.cse0 (select .cse8 c_t_funThread4of4ForFork0_~p~0.base))) (let ((.cse3 (store .cse0 c_t_funThread4of4ForFork0_~p~0.offset v_ArrVal_1033))) (let ((.cse7 (store .cse8 c_t_funThread4of4ForFork0_~p~0.base .cse3))) (let ((.cse4 (select .cse7 t_funThread3of4ForFork0_~p~0.base))) (or (< v_ArrVal_1033 (+ (select .cse0 c_t_funThread4of4ForFork0_~p~0.offset) 1)) (< 0 (select (select (store (store (store .cse1 c_t_funThread2of4ForFork0_~p~0.base .cse2) c_t_funThread4of4ForFork0_~p~0.base .cse3) t_funThread3of4ForFork0_~p~0.base (store .cse4 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1035)) |c_~#global~0.base|) |c_~#global~0.offset|)) (< v_ArrVal_1030 (+ (select .cse5 t_funThread3of4ForFork0_~p~0.offset) 1)) (< (+ v_ArrVal_1035 1) (select .cse4 t_funThread3of4ForFork0_~p~0.offset)) (< (+ v_ArrVal_1032 1) (select .cse6 c_t_funThread2of4ForFork0_~p~0.offset)) (< (select (select .cse7 |c_~#global~0.base|) |c_~#global~0.offset|) 1) (< (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|) 0))))))))))))) is different from false [2024-08-27 13:29:37,586 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.offset Int) (v_ArrVal_1030 Int) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1033 Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (t_funThread2of4ForFork0_~p~0.offset Int) (t_funThread3of4ForFork0_~p~0.base Int) (t_funThread2of4ForFork0_~p~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (let ((.cse11 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (store .cse11 t_funThread2of4ForFork0_~p~0.offset (+ (select .cse11 t_funThread2of4ForFork0_~p~0.offset) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1028))) (let ((.cse2 (select .cse1 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse10 (store .cse2 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1030))) (let ((.cse7 (select (store .cse1 t_funThread3of4ForFork0_~p~0.base .cse10) t_funThread2of4ForFork0_~p~0.base))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1028)) (.cse4 (store .cse7 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1032))) (let ((.cse9 (store (store .cse3 t_funThread3of4ForFork0_~p~0.base .cse10) t_funThread2of4ForFork0_~p~0.base .cse4))) (let ((.cse8 (select .cse9 c_t_funThread4of4ForFork0_~p~0.base))) (let ((.cse5 (store .cse8 c_t_funThread4of4ForFork0_~p~0.offset v_ArrVal_1033))) (let ((.cse6 (store .cse9 c_t_funThread4of4ForFork0_~p~0.base .cse5))) (let ((.cse0 (select .cse6 t_funThread3of4ForFork0_~p~0.base))) (or (< (+ v_ArrVal_1035 1) (select .cse0 t_funThread3of4ForFork0_~p~0.offset)) (< (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|) 0) (< v_ArrVal_1030 (+ (select .cse2 t_funThread3of4ForFork0_~p~0.offset) 1)) (< 0 (select (select (store (store (store .cse3 t_funThread2of4ForFork0_~p~0.base .cse4) c_t_funThread4of4ForFork0_~p~0.base .cse5) t_funThread3of4ForFork0_~p~0.base (store .cse0 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1035)) |c_~#global~0.base|) |c_~#global~0.offset|)) (< (select (select .cse6 |c_~#global~0.base|) |c_~#global~0.offset|) 1) (< (+ v_ArrVal_1032 1) (select .cse7 t_funThread2of4ForFork0_~p~0.offset)) (< v_ArrVal_1033 (+ (select .cse8 c_t_funThread4of4ForFork0_~p~0.offset) 1)))))))))))))) is different from false [2024-08-27 13:29:38,210 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-08-27 13:29:38,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3685285 treesize of output 2240234 [2024-08-27 13:29:39,650 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-08-27 13:29:39,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43229 treesize of output 41371 [2024-08-27 13:29:41,962 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-08-27 13:29:41,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59432 treesize of output 57938 [2024-08-27 13:29:51,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:29:51,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3545 treesize of output 3519 [2024-08-27 13:35:30,136 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-08-27 13:35:30,137 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-08-27 13:35:30,136 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 101 [2024-08-27 13:35:30,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-08-27 13:35:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 13:35:30,339 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2024-08-27 13:35:30,342 INFO L158 Benchmark]: Toolchain (without parser) took 380784.17ms. Allocated memory was 169.9MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 93.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-08-27 13:35:30,342 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 169.9MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 13:35:30,342 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 13:35:30,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.28ms. Allocated memory is still 169.9MB. Free memory was 93.7MB in the beginning and 127.0MB in the end (delta: -33.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-08-27 13:35:30,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.12ms. Allocated memory is still 169.9MB. Free memory was 127.0MB in the beginning and 124.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 13:35:30,344 INFO L158 Benchmark]: Boogie Preprocessor took 28.86ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 122.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 13:35:30,344 INFO L158 Benchmark]: RCFGBuilder took 591.70ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 79.6MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-08-27 13:35:30,344 INFO L158 Benchmark]: TraceAbstraction took 379555.15ms. Allocated memory was 169.9MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 78.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-08-27 13:35:30,345 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.18ms. Allocated memory is still 169.9MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.28ms. Allocated memory is still 169.9MB. Free memory was 93.7MB in the beginning and 127.0MB in the end (delta: -33.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.12ms. Allocated memory is still 169.9MB. Free memory was 127.0MB in the beginning and 124.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.86ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 122.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.70ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 79.6MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 379555.15ms. Allocated memory was 169.9MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 78.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 380, dependent conditional: 322, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 65, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1641, independent: 1568, independent conditional: 13, independent unconditional: 1555, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1641, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, independent: 146, independent conditional: 29, independent unconditional: 117, dependent: 193, dependent conditional: 35, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3192, independent: 1460, independent conditional: 1, independent unconditional: 1459, dependent: 91, dependent conditional: 4, dependent unconditional: 87, unknown: 1641, unknown conditional: 26, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1568, Positive conditional cache size: 13, Positive unconditional cache size: 1555, Negative cache size: 73, Negative conditional cache size: 13, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 3, Independence queries for same thread: 295 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 406, Number of trivial persistent sets: 362, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2190, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 380, dependent conditional: 322, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 65, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1641, independent: 1568, independent conditional: 13, independent unconditional: 1555, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1641, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, independent: 146, independent conditional: 29, independent unconditional: 117, dependent: 193, dependent conditional: 35, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3192, independent: 1460, independent conditional: 1, independent unconditional: 1459, dependent: 91, dependent conditional: 4, dependent unconditional: 87, unknown: 1641, unknown conditional: 26, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1568, Positive conditional cache size: 13, Positive unconditional cache size: 1555, Negative cache size: 73, Negative conditional cache size: 13, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 3, Independence queries for same thread: 295 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 311, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 19, dependent conditional: 14, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 263, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 263, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 263, unknown conditional: 0, unknown unconditional: 263] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 14 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 13, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 311, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 19, dependent conditional: 14, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 263, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 263, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 263, unknown conditional: 0, unknown unconditional: 263] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 14 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9773, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 912, dependent conditional: 790, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 315, independent unconditional: 8546, dependent: 652, dependent conditional: 292, dependent unconditional: 360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4471, independent: 4313, independent conditional: 27, independent unconditional: 4286, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4471, independent: 4224, independent conditional: 0, independent unconditional: 4224, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 472, independent: 172, independent conditional: 56, independent unconditional: 116, dependent: 300, dependent conditional: 72, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9513, independent: 4548, independent conditional: 147, independent unconditional: 4401, dependent: 494, dependent conditional: 76, dependent unconditional: 418, unknown: 4471, unknown conditional: 58, unknown unconditional: 4413] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4313, Positive conditional cache size: 27, Positive unconditional cache size: 4286, Negative cache size: 158, Negative conditional cache size: 31, Negative unconditional cache size: 127, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 326, Maximal queried relation: 5, Independence queries for same thread: 714 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 956, Number of trivial persistent sets: 884, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5042, independent: 4920, independent conditional: 0, independent unconditional: 4920, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9773, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 912, dependent conditional: 790, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 315, independent unconditional: 8546, dependent: 652, dependent conditional: 292, dependent unconditional: 360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4471, independent: 4313, independent conditional: 27, independent unconditional: 4286, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4471, independent: 4224, independent conditional: 0, independent unconditional: 4224, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 472, independent: 172, independent conditional: 56, independent unconditional: 116, dependent: 300, dependent conditional: 72, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9513, independent: 4548, independent conditional: 147, independent unconditional: 4401, dependent: 494, dependent conditional: 76, dependent unconditional: 418, unknown: 4471, unknown conditional: 58, unknown unconditional: 4413] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4313, Positive conditional cache size: 27, Positive unconditional cache size: 4286, Negative cache size: 158, Negative conditional cache size: 31, Negative unconditional cache size: 127, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 326, Maximal queried relation: 5, Independence queries for same thread: 714 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1823, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 137, dependent conditional: 108, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 12, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1325, independent: 1293, independent conditional: 3, independent unconditional: 1290, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1325, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 65, independent conditional: 5, independent unconditional: 59, dependent: 48, dependent conditional: 5, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1739, independent: 393, independent conditional: 2, independent unconditional: 391, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 1325, unknown conditional: 5, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1293, Positive conditional cache size: 3, Positive unconditional cache size: 1290, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 3, Independence queries for same thread: 101 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 47, Number of trivial persistent sets: 42, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1453, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1823, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 137, dependent conditional: 108, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 12, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1325, independent: 1293, independent conditional: 3, independent unconditional: 1290, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1325, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 65, independent conditional: 5, independent unconditional: 59, dependent: 48, dependent conditional: 5, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1739, independent: 393, independent conditional: 2, independent unconditional: 391, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 1325, unknown conditional: 5, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1293, Positive conditional cache size: 3, Positive unconditional cache size: 1290, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 3, Independence queries for same thread: 101 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4308, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 272, dependent conditional: 206, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 25, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3208, independent: 3135, independent conditional: 11, independent unconditional: 3124, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3208, independent: 3076, independent conditional: 0, independent unconditional: 3076, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 103, independent conditional: 20, independent unconditional: 83, dependent: 108, dependent conditional: 7, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4156, independent: 901, independent conditional: 3, independent unconditional: 898, dependent: 47, dependent conditional: 1, dependent unconditional: 46, unknown: 3208, unknown conditional: 15, unknown unconditional: 3193] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3135, Positive conditional cache size: 11, Positive unconditional cache size: 3124, Negative cache size: 73, Negative conditional cache size: 4, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 3, Independence queries for same thread: 191 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 96, Number of trivial persistent sets: 86, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3478, independent: 3412, independent conditional: 0, independent unconditional: 3412, 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: 4308, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 272, dependent conditional: 206, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 25, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3208, independent: 3135, independent conditional: 11, independent unconditional: 3124, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3208, independent: 3076, independent conditional: 0, independent unconditional: 3076, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 103, independent conditional: 20, independent unconditional: 83, dependent: 108, dependent conditional: 7, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4156, independent: 901, independent conditional: 3, independent unconditional: 898, dependent: 47, dependent conditional: 1, dependent unconditional: 46, unknown: 3208, unknown conditional: 15, unknown unconditional: 3193] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3135, Positive conditional cache size: 11, Positive unconditional cache size: 3124, Negative cache size: 73, Negative conditional cache size: 4, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 3, Independence queries for same thread: 191 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-08-27 13:35:30,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Ended with exit code 0 [2024-08-27 13:35:30,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:30,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:31,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:31,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/goblint-regression/28-race_reach_12-ptr_racefree.i ./goblint.2024-08-20_10-08-36.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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.dk.goblint-eval-da67795-m [2024-08-27 13:35:33,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 13:35:33,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-08-27 13:35:33,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 13:35:33,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 13:35:33,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 13:35:33,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 13:35:33,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 13:35:33,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 13:35:33,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 13:35:33,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 13:35:33,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 13:35:33,892 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 13:35:33,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 13:35:33,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 13:35:33,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 13:35:33,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 13:35:33,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 13:35:33,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 13:35:33,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 13:35:33,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 13:35:33,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-27 13:35:33,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 13:35:33,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-27 13:35:33,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 13:35:33,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 13:35:33,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 13:35:33,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 13:35:33,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 13:35:33,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 13:35:33,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 13:35:33,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 13:35:33,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 13:35:33,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 13:35:33,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 13:35:33,903 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-27 13:35:33,904 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 13:35:33,904 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-27 13:35:33,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 13:35:33,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 13:35:33,904 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 13:35:33,905 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 13:35:33,905 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 13:35:33,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-27 13:35:33,906 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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-27 13:35:34,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 13:35:34,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 13:35:34,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 13:35:34,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 13:35:34,232 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 13:35:34,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-08-27 13:35:35,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 13:35:35,972 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 13:35:35,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-08-27 13:35:35,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2c91d4a48/7d35a9fe6aef4c159a3d10945bd1c3ad/FLAG30261a084 [2024-08-27 13:35:36,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2c91d4a48/7d35a9fe6aef4c159a3d10945bd1c3ad [2024-08-27 13:35:36,309 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 13:35:36,309 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 13:35:36,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml [2024-08-27 13:35:36,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 13:35:36,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 13:35:36,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 13:35:36,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 13:35:36,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 13:35:36,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:35:36" (1/2) ... [2024-08-27 13:35:36,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6922445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:35:36, skipping insertion in model container [2024-08-27 13:35:36,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:35:36" (1/2) ... [2024-08-27 13:35:36,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d4785da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:35:36, skipping insertion in model container [2024-08-27 13:35:36,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:35:36" (2/2) ... [2024-08-27 13:35:36,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6922445 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36, skipping insertion in model container [2024-08-27 13:35:36,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:35:36" (2/2) ... [2024-08-27 13:35:36,376 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 13:35:36,403 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 13:35:36,404 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-08-27 13:35:36,404 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-08-27 13:35:36,404 INFO L1541 ArrayList]: Location invariant before [L703-L703] 1 <= global [2024-08-27 13:35:36,404 INFO L1541 ArrayList]: Location invariant before [L703-L703] 0 <= global [2024-08-27 13:35:36,450 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 13:35:36,796 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2024-08-27 13:35:36,821 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 13:35:36,837 INFO L202 MainTranslator]: Completed pre-run [2024-08-27 13:35:36,886 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-27 13:35:36,924 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 13:35:36,972 INFO L206 MainTranslator]: Completed translation [2024-08-27 13:35:36,973 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36 WrapperNode [2024-08-27 13:35:36,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 13:35:36,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 13:35:36,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 13:35:36,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 13:35:36,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,035 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-08-27 13:35:37,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 13:35:37,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 13:35:37,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 13:35:37,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 13:35:37,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 13:35:37,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 13:35:37,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 13:35:37,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 13:35:37,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (1/1) ... [2024-08-27 13:35:37,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 13:35:37,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:35:37,135 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-27 13:35:37,138 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-27 13:35:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-08-27 13:35:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-27 13:35:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 13:35:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 13:35:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-08-27 13:35:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-08-27 13:35:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 13:35:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-08-27 13:35:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-08-27 13:35:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-08-27 13:35:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-27 13:35:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 13:35:37,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 13:35:37,184 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 13:35:37,318 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 13:35:37,320 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 13:35:37,593 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 13:35:37,593 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 13:35:37,881 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 13:35:37,882 INFO L318 CfgBuilder]: Removed 10 assume(true) statements. [2024-08-27 13:35:37,883 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:35:37 BoogieIcfgContainer [2024-08-27 13:35:37,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 13:35:37,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 13:35:37,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 13:35:37,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 13:35:37,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:35:36" (1/4) ... [2024-08-27 13:35:37,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e51c28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:35:37, skipping insertion in model container [2024-08-27 13:35:37,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:35:36" (2/4) ... [2024-08-27 13:35:37,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e51c28c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:35:37, skipping insertion in model container [2024-08-27 13:35:37,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:35:36" (3/4) ... [2024-08-27 13:35:37,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e51c28c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:35:37, skipping insertion in model container [2024-08-27 13:35:37,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:35:37" (4/4) ... [2024-08-27 13:35:37,892 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-08-27 13:35:37,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 13:35:37,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-08-27 13:35:37,910 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 13:35:37,952 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-08-27 13:35:37,993 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:37,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:35:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:35:37,995 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-27 13:35:37,997 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-27 13:35:38,031 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:35:38,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-08-27 13:35:38,051 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:38,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:35:38,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:38,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1409461478, now seen corresponding path program 1 times [2024-08-27 13:35:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427800606] [2024-08-27 13:35:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:38,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:38,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-08-27 13:35:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:38,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:35:38,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:35:38,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:38,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427800606] [2024-08-27 13:35:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427800606] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:38,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:38,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:35:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939280473] [2024-08-27 13:35:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:38,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:35:38,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:35:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:35:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:38,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:38,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-27 13:35:38,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:38,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:38,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:38,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1340007802, now seen corresponding path program 1 times [2024-08-27 13:35:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821927698] [2024-08-27 13:35:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:38,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:38,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-08-27 13:35:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:38,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:35:38,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:38,896 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:35:38,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:35:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:39,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:39,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:35:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:39,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:39,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821927698] [2024-08-27 13:35:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821927698] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:35:39,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:35:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2024-08-27 13:35:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207070729] [2024-08-27 13:35:39,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:35:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 13:35:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 13:35:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=14, Unknown=3, NotChecked=0, Total=30 [2024-08-27 13:35:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:39,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:39,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:35:39,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:39,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:39,289 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_22 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_22) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:35:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:39,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:39,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:39,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:39,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1900376336, now seen corresponding path program 1 times [2024-08-27 13:35:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54612479] [2024-08-27 13:35:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:39,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:39,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-08-27 13:35:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:39,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 13:35:39,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:39,632 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:35:39,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:35:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:39,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:39,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-08-27 13:35:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:35:39,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:35:40,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_40 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_40) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-08-27 13:35:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 13:35:40,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54612479] [2024-08-27 13:35:40,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54612479] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:35:40,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:35:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-08-27 13:35:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066225024] [2024-08-27 13:35:40,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:35:40,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 13:35:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 13:35:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=7, NotChecked=14, Total=90 [2024-08-27 13:35:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:40,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:40,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-27 13:35:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:40,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:35:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:35:41,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-27 13:35:41,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-27 13:35:41,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:41,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:41,918 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-27 13:35:41,921 INFO L308 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE (1/2) [2024-08-27 13:35:41,925 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:41,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:35:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:35:41,927 INFO L229 MonitoredProcess]: Starting monitored process 6 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-27 13:35:41,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-27 13:35:41,931 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:35:41,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:35:41,932 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:41,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:35:41,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:35:41,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1982956789, now seen corresponding path program 1 times [2024-08-27 13:35:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221278210] [2024-08-27 13:35:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:41,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:41,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-08-27 13:35:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:42,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:35:42,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:35:42,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:42,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221278210] [2024-08-27 13:35:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221278210] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:42,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:35:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350826212] [2024-08-27 13:35:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:42,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:35:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:35:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:35:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:42,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:42,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:35:42,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:42,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:42,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:42,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:35:42,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:42,284 INFO L85 PathProgramCache]: Analyzing trace with hash 256811667, now seen corresponding path program 1 times [2024-08-27 13:35:42,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:42,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838738616] [2024-08-27 13:35:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:42,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:42,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-08-27 13:35:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:35:42,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:35:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:35:42,408 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 13:35:42,410 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:35:42,410 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:35:42,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:35:42,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:35:42,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:35:42,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:42,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:42,613 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 13:35:42,614 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-08-27 13:35:42,615 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:35:42,615 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 13:35:42,650 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-08-27 13:35:42,656 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:35:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:35:42,659 INFO L229 MonitoredProcess]: Starting monitored process 9 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-27 13:35:42,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-08-27 13:35:42,663 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:35:42,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-08-27 13:35:42,664 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:35:42,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:35:43,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:43,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1412216993, now seen corresponding path program 1 times [2024-08-27 13:35:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082872127] [2024-08-27 13:35:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:43,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:43,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-08-27 13:35:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:43,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:35:43,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:35:43,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:43,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:43,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082872127] [2024-08-27 13:35:43,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082872127] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:43,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:43,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:35:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289977291] [2024-08-27 13:35:43,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:43,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:35:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:35:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:35:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:43,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-27 13:35:43,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-08-27 13:35:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:43,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:43,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1337217498, now seen corresponding path program 1 times [2024-08-27 13:35:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959199518] [2024-08-27 13:35:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:43,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:43,433 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:43,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-08-27 13:35:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:43,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:35:43,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:43,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:35:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:35:43,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:43,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:43,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959199518] [2024-08-27 13:35:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959199518] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:35:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642244161] [2024-08-27 13:35:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:35:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:35:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:35:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:43,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-27 13:35:43,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:43,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-08-27 13:35:43,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:43,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:43,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1590475643, now seen corresponding path program 1 times [2024-08-27 13:35:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802169289] [2024-08-27 13:35:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:43,774 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:43,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-08-27 13:35:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:43,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:35:43,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:43,884 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:35:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:35:43,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:43,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:44,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:35:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:44,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802169289] [2024-08-27 13:35:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802169289] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:35:44,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:35:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2024-08-27 13:35:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277729607] [2024-08-27 13:35:44,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:35:44,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 13:35:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 13:35:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=14, Unknown=3, NotChecked=0, Total=30 [2024-08-27 13:35:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:44,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 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-27 13:35:44,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:44,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,161 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_101 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_101) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:35:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:44,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-08-27 13:35:44,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:44,463 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:44,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 595519048, now seen corresponding path program 1 times [2024-08-27 13:35:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910734762] [2024-08-27 13:35:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:44,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:44,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:44,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-08-27 13:35:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:44,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:35:44,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:35:44,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:35:44,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:35:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:44,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:44,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910734762] [2024-08-27 13:35:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910734762] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:44,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:35:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795412202] [2024-08-27 13:35:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:44,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:35:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:35:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:35:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-27 13:35:44,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:44,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:44,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:44,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-08-27 13:35:45,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:45,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:45,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2059729271, now seen corresponding path program 1 times [2024-08-27 13:35:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958971705] [2024-08-27 13:35:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:45,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:45,014 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:45,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-08-27 13:35:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:45,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-27 13:35:45,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:45,129 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:35:45,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:35:45,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:45,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:45,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-08-27 13:35:45,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:35:45,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:35:45,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#global~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_145) |c_~#global~0.base|))) (store .cse0 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse0 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:35:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2024-08-27 13:35:45,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:45,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958971705] [2024-08-27 13:35:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958971705] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:35:45,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:35:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2024-08-27 13:35:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813493596] [2024-08-27 13:35:45,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:35:45,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-27 13:35:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:45,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-27 13:35:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=45, Unknown=20, NotChecked=16, Total=110 [2024-08-27 13:35:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:45,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:45,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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-27 13:35:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:45,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:48,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 13:35:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:35:50,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:50,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:50,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:50,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1350947485, now seen corresponding path program 1 times [2024-08-27 13:35:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:50,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166470713] [2024-08-27 13:35:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:50,343 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:50,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-08-27 13:35:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:50,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:35:50,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:50,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:35:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:35:50,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:50,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166470713] [2024-08-27 13:35:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166470713] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:35:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399625333] [2024-08-27 13:35:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:50,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:35:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:35:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:35:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:50,636 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:50,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:35:50,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:35:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:35:51,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-08-27 13:35:51,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:51,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:51,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash -395286238, now seen corresponding path program 1 times [2024-08-27 13:35:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:51,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429506194] [2024-08-27 13:35:51,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:35:51,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:51,238 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:51,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-08-27 13:35:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:35:51,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 13:35:51,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:51,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:35:51,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:35:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:35:51,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:35:51,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429506194] [2024-08-27 13:35:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429506194] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:35:51,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:35:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-27 13:35:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107118959] [2024-08-27 13:35:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:35:51,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 13:35:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 13:35:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-08-27 13:35:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:51,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:51,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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-27 13:35:51,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:51,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:51,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:51,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:51,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:35:51,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:35:51,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:53,437 WARN L854 $PredicateComparison]: unable to prove that (and (bvsle (_ bv1 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|)) (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse0 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of2ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-08-27 13:35:55,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 13:35:57,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:35:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:35:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:35:58,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-08-27 13:35:58,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:58,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:35:58,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:35:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1952924707, now seen corresponding path program 2 times [2024-08-27 13:35:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:35:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224978970] [2024-08-27 13:35:58,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 13:35:58,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:35:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:35:58,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:35:58,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-08-27 13:35:58,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 13:35:58,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:35:58,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 13:35:58,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:35:58,563 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:35:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:35:58,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:35:58,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:35:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:35:59,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:35:59,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:35:59,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 152 [2024-08-27 13:35:59,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:35:59,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 154 [2024-08-27 13:35:59,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2024-08-27 13:35:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:35:59,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:35:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224978970] [2024-08-27 13:35:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224978970] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:35:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:35:59,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-08-27 13:35:59,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604131364] [2024-08-27 13:35:59,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:35:59,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-27 13:35:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:35:59,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-27 13:35:59,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=70, Unknown=8, NotChecked=0, Total=110 [2024-08-27 13:35:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:59,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:35:59,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:35:59,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:35:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:36:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:36:05,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-08-27 13:36:05,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:05,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:05,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -364871326, now seen corresponding path program 2 times [2024-08-27 13:36:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955316369] [2024-08-27 13:36:05,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 13:36:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:05,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:05,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:05,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-08-27 13:36:06,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 13:36:06,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:36:06,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-27 13:36:06,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:06,041 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:36:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:36:06,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:36:06,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:36:06,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:36:06,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:36:07,044 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_283) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:07,056 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse0 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of2ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_283) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:07,745 INFO L349 Elim1Store]: treesize reduction 116, result has 55.7 percent of original size [2024-08-27 13:36:07,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 128 treesize of output 201 [2024-08-27 13:36:07,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:36:07,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1283 treesize of output 1256 [2024-08-27 13:36:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 134 [2024-08-27 13:36:08,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:36:08,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 85 [2024-08-27 13:36:08,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:36:08,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 154 [2024-08-27 13:36:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 13:36:10,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955316369] [2024-08-27 13:36:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955316369] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:36:10,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:36:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2024-08-27 13:36:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736586817] [2024-08-27 13:36:10,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:36:10,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-27 13:36:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-27 13:36:10,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=119, Unknown=11, NotChecked=50, Total=240 [2024-08-27 13:36:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:10,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:10,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 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-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:36:10,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:36:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:36:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:20,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:20,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:20,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:20,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1008281721, now seen corresponding path program 1 times [2024-08-27 13:36:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41532890] [2024-08-27 13:36:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:20,762 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-08-27 13:36:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:20,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:36:20,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:36:20,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:36:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:36:20,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41532890] [2024-08-27 13:36:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41532890] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:36:20,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:36:20,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-08-27 13:36:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634690449] [2024-08-27 13:36:20,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:36:20,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 13:36:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 13:36:20,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-08-27 13:36:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:20,985 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:20,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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-27 13:36:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:20,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:36:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 13:36:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 13:36:21,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-08-27 13:36:21,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-08-27 13:36:21,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-08-27 13:36:21,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:21,696 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-08-27 13:36:21,696 INFO L308 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE,SAFE (1/3) [2024-08-27 13:36:21,698 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:21,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:36:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:36:21,701 INFO L229 MonitoredProcess]: Starting monitored process 20 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-27 13:36:21,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-08-27 13:36:21,705 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:36:21,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:36:21,706 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:21,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:36:21,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:21,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1490163955, now seen corresponding path program 1 times [2024-08-27 13:36:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572055371] [2024-08-27 13:36:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:21,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:21,797 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:21,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-08-27 13:36:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:21,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:36:21,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:36:21,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:21,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572055371] [2024-08-27 13:36:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572055371] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:36:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269130677] [2024-08-27 13:36:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:36:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:36:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:36:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:21,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:21,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-27 13:36:21,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-08-27 13:36:22,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:22,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:22,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1224307985, now seen corresponding path program 1 times [2024-08-27 13:36:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393174303] [2024-08-27 13:36:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:22,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:22,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:22,202 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:22,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-08-27 13:36:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:22,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:36:22,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:22,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 13:36:22,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:22,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:22,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393174303] [2024-08-27 13:36:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393174303] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:36:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741686218] [2024-08-27 13:36:22,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:22,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:36:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:36:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:36:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:22,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-27 13:36:22,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:22,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-08-27 13:36:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:22,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:22,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 561278876, now seen corresponding path program 1 times [2024-08-27 13:36:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279148012] [2024-08-27 13:36:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:22,569 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:22,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-08-27 13:36:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:22,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:36:22,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:22,671 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:36:22,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:36:22,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:22,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:36:22,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:36:22,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_354) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-08-27 13:36:22,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279148012] [2024-08-27 13:36:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279148012] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:36:22,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:36:22,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 13:36:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081000909] [2024-08-27 13:36:22,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:36:22,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 13:36:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:22,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 13:36:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=11, Unknown=1, NotChecked=6, Total=30 [2024-08-27 13:36:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:22,996 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-27 13:36:22,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:22,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:22,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:23,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-08-27 13:36:23,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:23,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:23,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 628024322, now seen corresponding path program 1 times [2024-08-27 13:36:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548480999] [2024-08-27 13:36:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:23,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:23,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:23,420 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:23,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-08-27 13:36:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:23,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:36:23,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:23,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:36:23,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:36:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:36:23,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:23,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:23,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548480999] [2024-08-27 13:36:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548480999] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:23,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:23,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:36:23,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423774350] [2024-08-27 13:36:23,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:36:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:23,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:36:23,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:36:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:23,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-27 13:36:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:23,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:23,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-08-27 13:36:23,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:23,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:23,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash -236219551, now seen corresponding path program 1 times [2024-08-27 13:36:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888360240] [2024-08-27 13:36:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:23,989 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:23,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-08-27 13:36:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:36:24,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:36:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:36:24,112 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 13:36:24,112 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:36:24,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:36:24,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:36:24,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:36:24,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:36:24,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-08-27 13:36:24,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:24,314 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 13:36:24,315 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-08-27 13:36:24,315 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:36:24,315 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 13:36:24,334 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-08-27 13:36:24,336 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:36:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:36:24,338 INFO L229 MonitoredProcess]: Starting monitored process 26 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-27 13:36:24,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-08-27 13:36:24,340 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:36:24,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 13:36:24,341 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:24,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-08-27 13:36:24,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:24,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 108318818, now seen corresponding path program 1 times [2024-08-27 13:36:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797456688] [2024-08-27 13:36:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:24,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:24,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:24,450 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:24,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-08-27 13:36:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:24,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:36:24,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:36:24,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:24,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797456688] [2024-08-27 13:36:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797456688] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:36:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009033448] [2024-08-27 13:36:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:24,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:36:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:36:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:36:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:24,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:24,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-27 13:36:24,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:24,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:24,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:24,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1039067680, now seen corresponding path program 1 times [2024-08-27 13:36:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223555283] [2024-08-27 13:36:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:24,899 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:24,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-08-27 13:36:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:24,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:36:24,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:24,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:36:25,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:25,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223555283] [2024-08-27 13:36:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223555283] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:36:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374343287] [2024-08-27 13:36:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:25,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:36:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:36:25,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:36:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-27 13:36:25,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:25,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:25,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:25,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:25,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1464234913, now seen corresponding path program 1 times [2024-08-27 13:36:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775643212] [2024-08-27 13:36:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:25,290 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:25,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-08-27 13:36:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:25,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:36:25,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:25,400 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:36:25,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:36:25,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:25,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:36:25,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:36:25,630 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_452) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-08-27 13:36:25,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775643212] [2024-08-27 13:36:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775643212] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:36:25,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:36:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 13:36:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218076287] [2024-08-27 13:36:25,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:36:25,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 13:36:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 13:36:25,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=11, Unknown=1, NotChecked=6, Total=30 [2024-08-27 13:36:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:25,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 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-27 13:36:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:25,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:25,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:26,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:26,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:26,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash -141537020, now seen corresponding path program 1 times [2024-08-27 13:36:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442574637] [2024-08-27 13:36:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:26,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:26,185 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:26,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-08-27 13:36:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:26,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:36:26,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:26,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:26,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:36:26,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:36:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 13:36:26,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:26,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442574637] [2024-08-27 13:36:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442574637] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:26,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:26,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:36:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411268421] [2024-08-27 13:36:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:36:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:36:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:36:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:26,493 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:26,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-27 13:36:26,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:26,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:26,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:26,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:26,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-08-27 13:36:26,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:26,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:26,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1530298880, now seen corresponding path program 1 times [2024-08-27 13:36:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109994596] [2024-08-27 13:36:26,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:26,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:26,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:26,788 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:26,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-08-27 13:36:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:26,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 13:36:26,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:26,904 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:36:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:36:26,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:27,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-08-27 13:36:27,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:36:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 13:36:27,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:36:29,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of3ForFork0_~p~0.base (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_500) c_t_funThread1of3ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of3ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of3ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_503) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:30,245 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#global~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_500) |c_~#global~0.base|))) (store .cse0 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse0 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_503) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-08-27 13:36:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-08-27 13:36:30,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109994596] [2024-08-27 13:36:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109994596] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:36:30,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:36:30,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-08-27 13:36:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051652935] [2024-08-27 13:36:30,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:36:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-27 13:36:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-27 13:36:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=40, Unknown=14, NotChecked=30, Total=110 [2024-08-27 13:36:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:30,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:30,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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-27 13:36:30,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:30,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:30,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:30,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:30,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:36:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 13:36:34,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:34,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:34,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-08-27 13:36:34,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash 754949187, now seen corresponding path program 1 times [2024-08-27 13:36:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013667110] [2024-08-27 13:36:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:34,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:34,475 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:34,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-08-27 13:36:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:36:34,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 13:36:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 13:36:34,649 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 13:36:34,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 13:36:34,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-08-27 13:36:34,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-08-27 13:36:34,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-08-27 13:36:34,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-08-27 13:36:34,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-08-27 13:36:34,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:34,851 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-08-27 13:36:34,851 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-08-27 13:36:34,851 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 13:36:34,852 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-27 13:36:34,883 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-08-27 13:36:34,885 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 13:36:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 13:36:34,887 INFO L229 MonitoredProcess]: Starting monitored process 33 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-27 13:36:34,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (33)] Waiting until timeout for monitored process [2024-08-27 13:36:34,891 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 13:36:34,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-08-27 13:36:34,891 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;@57640f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 13:36:34,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-08-27 13:36:35,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:35,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1793589666, now seen corresponding path program 1 times [2024-08-27 13:36:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314604148] [2024-08-27 13:36:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:35,045 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:35,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-08-27 13:36:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:35,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2024-08-27 13:36:35,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-08-27 13:36:35,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:35,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314604148] [2024-08-27 13:36:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314604148] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 13:36:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295510764] [2024-08-27 13:36:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:35,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-08-27 13:36:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-08-27 13:36:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-08-27 13:36:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:35,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:35,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-27 13:36:35,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:35,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:35,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:35,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:35,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2082636515, now seen corresponding path program 1 times [2024-08-27 13:36:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791386763] [2024-08-27 13:36:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:35,929 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:35,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-08-27 13:36:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:36,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:36:36,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:36,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 13:36:36,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:36,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791386763] [2024-08-27 13:36:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791386763] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:36,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:36,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:36:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033428351] [2024-08-27 13:36:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:36,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:36:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:36,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:36:36,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:36:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:36,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:36,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 13:36:36,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:36,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:37,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:38,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:38,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:38,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -744020649, now seen corresponding path program 1 times [2024-08-27 13:36:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370938935] [2024-08-27 13:36:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:38,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:38,174 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:38,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-08-27 13:36:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:38,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2024-08-27 13:36:38,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:38,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:36:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 13:36:38,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:38,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370938935] [2024-08-27 13:36:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370938935] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:38,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:38,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 13:36:38,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039216674] [2024-08-27 13:36:38,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:38,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 13:36:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 13:36:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 13:36:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:38,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:38,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:36:38,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:38,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:38,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:41,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:41,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:41,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:41,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1244164124, now seen corresponding path program 1 times [2024-08-27 13:36:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617022439] [2024-08-27 13:36:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:41,277 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:41,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-08-27 13:36:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:41,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 13:36:41,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:36:47,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:36:49,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:36:50,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:36:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:36:50,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:36:50,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:36:50,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617022439] [2024-08-27 13:36:50,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617022439] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:36:50,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:36:50,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-27 13:36:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612725198] [2024-08-27 13:36:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:36:50,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-27 13:36:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:36:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-27 13:36:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-08-27 13:36:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:50,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:36:50,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:36:50,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:50,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:50,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:50,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:36:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:36:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:36:55,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2024-08-27 13:36:55,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:55,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:36:55,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:36:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1703418428, now seen corresponding path program 1 times [2024-08-27 13:36:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:36:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602563844] [2024-08-27 13:36:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:36:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:36:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:36:55,275 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:36:55,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-08-27 13:36:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:36:55,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-27 13:36:55,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:37:03,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:37:05,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:37:06,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:37:08,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:37:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 13:37:08,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:37:08,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:37:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602563844] [2024-08-27 13:37:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602563844] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:37:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:37:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-27 13:37:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598114189] [2024-08-27 13:37:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:37:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-27 13:37:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:37:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-27 13:37:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-08-27 13:37:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:08,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:37:08,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:37:08,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:08,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:08,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:08,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 13:37:08,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:37:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:37:18,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2024-08-27 13:37:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:37:18,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:37:18,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:37:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 340456644, now seen corresponding path program 2 times [2024-08-27 13:37:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:37:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042067121] [2024-08-27 13:37:18,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 13:37:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:37:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:37:18,329 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:37:18,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-08-27 13:37:18,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 13:37:18,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:37:18,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-27 13:37:18,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:37:27,832 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2024-08-27 13:37:27,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2024-08-27 13:37:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-08-27 13:37:33,362 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2024-08-27 13:37:33,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 42 [2024-08-27 13:37:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 13:37:34,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:37:34,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:37:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042067121] [2024-08-27 13:37:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042067121] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:37:34,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:37:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-27 13:37:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552320228] [2024-08-27 13:37:34,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:37:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-27 13:37:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:37:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-27 13:37:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-08-27 13:37:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:34,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:37:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:37:34,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:37:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:37:45,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:37:45,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2024-08-27 13:37:45,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:37:45,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:37:45,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:37:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1483870016, now seen corresponding path program 1 times [2024-08-27 13:37:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:37:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408015653] [2024-08-27 13:37:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:37:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:37:45,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:37:45,735 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:37:45,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2024-08-27 13:37:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:37:45,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-27 13:37:45,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:37:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 13:37:47,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:37:47,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:37:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-27 13:37:47,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 13:37:47,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:37:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408015653] [2024-08-27 13:37:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408015653] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 13:37:47,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 13:37:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 13:37:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960684059] [2024-08-27 13:37:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 13:37:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 13:37:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:37:47,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 13:37:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-08-27 13:37:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:47,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:37:47,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:37:47,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:38:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:38:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:38:00,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2024-08-27 13:38:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:38:00,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:38:00,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:38:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1105418971, now seen corresponding path program 1 times [2024-08-27 13:38:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:38:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763109362] [2024-08-27 13:38:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:38:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:38:00,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:38:00,214 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:38:00,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2024-08-27 13:38:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:38:00,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-27 13:38:00,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:38:00,586 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:38:00,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:38:06,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 13:38:07,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 13:38:07,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:38:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 13:38:08,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:38:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2024-08-27 13:38:11,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:38:11,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 144 [2024-08-27 13:38:11,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:38:11,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 136 [2024-08-27 13:38:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 4 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-27 13:38:14,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:38:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763109362] [2024-08-27 13:38:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763109362] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:38:14,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:38:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-08-27 13:38:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291326001] [2024-08-27 13:38:14,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:38:14,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-27 13:38:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:38:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-27 13:38:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=85, Unknown=8, NotChecked=0, Total=132 [2024-08-27 13:38:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:14,347 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:38:14,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.909090909090908) internal successors, (120), 11 states have internal predecessors, (120), 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-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:38:14,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:38:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:38:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:38:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:38:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:38:26,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2024-08-27 13:38:26,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:38:26,449 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:38:26,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:38:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash 364888657, now seen corresponding path program 1 times [2024-08-27 13:38:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:38:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112766093] [2024-08-27 13:38:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 13:38:26,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:38:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:38:26,451 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:38:26,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-08-27 13:38:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 13:38:26,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 13:38:26,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:38:26,880 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:38:26,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:38:34,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:38:35,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:38:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:38:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:38:38,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:38:40,764 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1030))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|)))))) is different from false [2024-08-27 13:38:40,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread2of4ForFork0_~p~0.offset (bvadd (select .cse2 c_t_funThread2of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1030))) (or (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|))))) is different from false [2024-08-27 13:38:42,078 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-08-27 13:38:42,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 85 [2024-08-27 13:38:42,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:38:42,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 289 [2024-08-27 13:38:42,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:38:42,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 174 [2024-08-27 13:38:44,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:38:44,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 230 [2024-08-27 13:38:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2024-08-27 13:38:59,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:38:59,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112766093] [2024-08-27 13:38:59,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112766093] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:38:59,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:38:59,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2024-08-27 13:38:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888072516] [2024-08-27 13:38:59,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:38:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-08-27 13:38:59,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:38:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-08-27 13:38:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=157, Unknown=2, NotChecked=54, Total=272 [2024-08-27 13:38:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:59,997 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:38:59,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 8.625) internal successors, (138), 16 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:38:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:38:59,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:39:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:39:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:39:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:39:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 13:39:14,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2024-08-27 13:39:14,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:39:14,479 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 13:39:14,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 13:39:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash 151979082, now seen corresponding path program 3 times [2024-08-27 13:39:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 13:39:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292563666] [2024-08-27 13:39:14,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-27 13:39:14,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 13:39:14,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 13:39:14,481 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 13:39:14,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2024-08-27 13:39:14,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-08-27 13:39:14,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 13:39:14,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjunts are in the unsatisfiable core [2024-08-27 13:39:14,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 13:39:14,948 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 13:39:14,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 13:39:19,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-08-27 13:39:21,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:39:23,708 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-08-27 13:39:23,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2024-08-27 13:39:27,521 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-08-27 13:39:27,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2024-08-27 13:39:31,321 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-08-27 13:39:31,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2024-08-27 13:39:36,528 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-08-27 13:39:36,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2024-08-27 13:39:36,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 13:39:39,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-08-27 13:39:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 13:39:40,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 13:39:43,318 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1111))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|)))))) is different from false [2024-08-27 13:39:44,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse2 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1111))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|)))))) is different from false [2024-08-27 13:40:11,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse5 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse5 c_t_funThread2of4ForFork0_~p~0.offset (bvadd (select .cse5 c_t_funThread2of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse3 (select .cse2 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse0 (store (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset .cse4)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1111))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv1 32) (select (select (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse4))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))))))))) is different from false [2024-08-27 13:40:20,394 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1106 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse5 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (let ((.cse0 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse5 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1106 (_ bv4294967295 32)))))) (let ((.cse1 (select .cse0 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse2 (select .cse1 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse3 (store (store .cse0 t_funThread3of4ForFork0_~p~0.base (store .cse1 t_funThread3of4ForFork0_~p~0.offset .cse2)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1111))) (or (not (bvsle (_ bv1 32) (select (select (store .cse0 t_funThread3of4ForFork0_~p~0.base (store .cse1 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse2))) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse3 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse4 (select .cse3 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse4 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse4 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse5 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1106)) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse3 |c_~#global~0.base|) |c_~#global~0.offset|)))))))))) is different from false [2024-08-27 13:40:38,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1106 (_ BitVec 32)) (v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1104))) (let ((.cse5 (select .cse1 t_funThread2of4ForFork0_~p~0.base))) (let ((.cse6 (store .cse5 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1106 (_ bv4294967295 32))))) (let ((.cse2 (store .cse1 t_funThread2of4ForFork0_~p~0.base .cse6))) (let ((.cse3 (select .cse2 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse6) t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset .cse4)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1111) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse0)) (not (bvsle (_ bv0 32) .cse0)) (not (bvsle (_ bv0 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset (bvadd .cse4 (_ bv1 32)))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse1 t_funThread2of4ForFork0_~p~0.base (store .cse5 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1106)) |c_~#global~0.base|) |c_~#global~0.offset|)))))))))))) is different from false [2024-08-27 13:40:52,560 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-08-27 13:40:52,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 543 treesize of output 284 [2024-08-27 13:40:55,518 INFO L349 Elim1Store]: treesize reduction 69, result has 50.0 percent of original size [2024-08-27 13:40:55,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 6603 treesize of output 6249 [2024-08-27 13:40:55,993 INFO L224 Elim1Store]: Index analysis took 222 ms [2024-08-27 13:40:56,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:40:56,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3556 treesize of output 3394 [2024-08-27 13:40:56,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1220 treesize of output 1172 [2024-08-27 13:40:57,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:40:57,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5008 treesize of output 4754 [2024-08-27 13:41:27,506 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 13:41:27,508 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-08-27 13:41:27,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 13:41:27,517 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-08-27 13:41:34,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 13:41:34,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 425 treesize of output 415 [2024-08-27 13:41:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2024-08-27 13:41:40,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 13:41:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292563666] [2024-08-27 13:41:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292563666] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 13:41:40,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 13:41:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 27 [2024-08-27 13:41:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376428590] [2024-08-27 13:41:40,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 13:41:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-27 13:41:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 13:41:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-27 13:41:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=420, Unknown=44, NotChecked=240, Total=812 [2024-08-27 13:41:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:41:40,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 13:41:40,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 13:41:40,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 13:41:40,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 13:41:40,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 13:41:40,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 13:41:52,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 13:42:31,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 13:42:40,254 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 123 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15