./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas_longer-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas_longer-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 02:57:19,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 02:57:19,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 02:57:19,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 02:57:19,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 02:57:19,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 02:57:19,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 02:57:19,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 02:57:19,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 02:57:19,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 02:57:19,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 02:57:19,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 02:57:19,613 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 02:57:19,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 02:57:19,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 02:57:19,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 02:57:19,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 02:57:19,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 02:57:19,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 02:57:19,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 02:57:19,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 02:57:19,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 02:57:19,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 02:57:19,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 02:57:19,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 02:57:19,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 02:57:19,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 02:57:19,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 02:57:19,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 02:57:19,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 02:57:19,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 02:57:19,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 02:57:19,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 02:57:19,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 02:57:19,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 02:57:19,621 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 02:57:19,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 02:57:19,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 02:57:19,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 02:57:19,625 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 02:57:19,625 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 02:57:19,625 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-09-08 02:57:19,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 02:57:19,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 02:57:19,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 02:57:19,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 02:57:19,883 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 02:57:19,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 02:57:21,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 02:57:21,527 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 02:57:21,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 02:57:21,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/068cfa7e7/b6daa6bf2074451995a47bc937bb166e/FLAG48c90cf8d [2024-09-08 02:57:21,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/068cfa7e7/b6daa6bf2074451995a47bc937bb166e [2024-09-08 02:57:21,549 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 02:57:21,550 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 02:57:21,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas_longer-1.yml/witness.yml [2024-09-08 02:57:21,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 02:57:21,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 02:57:21,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 02:57:21,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 02:57:21,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 02:57:21,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:57:21" (1/2) ... [2024-09-08 02:57:21,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb4352a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:57:21, skipping insertion in model container [2024-09-08 02:57:21,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:57:21" (1/2) ... [2024-09-08 02:57:21,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ad4c17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:57:21, skipping insertion in model container [2024-09-08 02:57:21,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:57:21" (2/2) ... [2024-09-08 02:57:21,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb4352a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:21, skipping insertion in model container [2024-09-08 02:57:21,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:57:21" (2/2) ... [2024-09-08 02:57:21,608 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 02:57:21,609 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-08 02:57:21,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 02:57:21,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 02:57:21,921 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 02:57:21,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 02:57:22,037 INFO L204 MainTranslator]: Completed translation [2024-09-08 02:57:22,038 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22 WrapperNode [2024-09-08 02:57:22,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 02:57:22,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 02:57:22,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 02:57:22,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 02:57:22,049 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 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,066 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 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,099 INFO L138 Inliner]: procedures = 179, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 200 [2024-09-08 02:57:22,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 02:57:22,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 02:57:22,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 02:57:22,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 02:57:22,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 02:57:22,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 02:57:22,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 02:57:22,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 02:57:22,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (1/1) ... [2024-09-08 02:57:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 02:57:22,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:22,205 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-09-08 02:57:22,207 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-09-08 02:57:22,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 02:57:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 02:57:22,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 02:57:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 02:57:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 02:57:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 02:57:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 02:57:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 02:57:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 02:57:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 02:57:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 02:57:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 02:57:22,277 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 02:57:22,403 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 02:57:22,406 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 02:57:22,681 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 02:57:22,681 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 02:57:22,850 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 02:57:22,851 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-08 02:57:22,852 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:57:22 BoogieIcfgContainer [2024-09-08 02:57:22,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 02:57:22,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 02:57:22,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 02:57:22,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 02:57:22,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:57:21" (1/4) ... [2024-09-08 02:57:22,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d8c120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:57:22, skipping insertion in model container [2024-09-08 02:57:22,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:57:21" (2/4) ... [2024-09-08 02:57:22,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d8c120 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 02:57:22, skipping insertion in model container [2024-09-08 02:57:22,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:57:22" (3/4) ... [2024-09-08 02:57:22,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d8c120 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 02:57:22, skipping insertion in model container [2024-09-08 02:57:22,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:57:22" (4/4) ... [2024-09-08 02:57:22,861 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-09-08 02:57:22,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 02:57:22,873 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 02:57:22,873 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 02:57:22,914 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 02:57:22,941 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:22,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 02:57:22,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:22,943 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-09-08 02:57:22,946 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-09-08 02:57:22,976 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 02:57:22,985 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 02:57:22,989 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@36d53a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:22,990 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 02:57:23,077 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:23,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1521780113, now seen corresponding path program 1 times [2024-09-08 02:57:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879077469] [2024-09-08 02:57:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:23,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:23,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879077469] [2024-09-08 02:57:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879077469] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 02:57:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438559497] [2024-09-08 02:57:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:23,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 02:57:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 02:57:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 02:57:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:23,424 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:23,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 02:57:23,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:23,459 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 02:57:23,459 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:23,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1823734536, now seen corresponding path program 1 times [2024-09-08 02:57:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011731081] [2024-09-08 02:57:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011731081] [2024-09-08 02:57:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011731081] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710083886] [2024-09-08 02:57:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:23,751 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-09-08 02:57:23,752 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-09-08 02:57:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:23,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 02:57:23,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:23,925 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-09-08 02:57:23,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:23,978 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-09-08 02:57:23,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:23,998 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 19 treesize of output 18 [2024-09-08 02:57:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:24,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 02:57:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710083886] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 02:57:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-09-08 02:57:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509533628] [2024-09-08 02:57:24,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:24,088 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:24,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:24,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-08 02:57:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,089 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:24,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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-09-08 02:57:24,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-08 02:57:24,388 WARN L456 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-09-08 02:57:24,389 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:24,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:24,389 INFO L85 PathProgramCache]: Analyzing trace with hash 925778014, now seen corresponding path program 1 times [2024-09-08 02:57:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066389884] [2024-09-08 02:57:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066389884] [2024-09-08 02:57:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066389884] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 02:57:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888848538] [2024-09-08 02:57:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:24,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 02:57:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,503 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:24,504 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-09-08 02:57:24,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 02:57:24,600 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:24,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1291862496, now seen corresponding path program 1 times [2024-09-08 02:57:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:24,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967327379] [2024-09-08 02:57:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:24,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967327379] [2024-09-08 02:57:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967327379] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:24,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687950692] [2024-09-08 02:57:24,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:24,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:24,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:24,678 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-09-08 02:57:24,688 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-09-08 02:57:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:24,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 02:57:24,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:24,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687950692] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:24,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:24,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 02:57:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978822634] [2024-09-08 02:57:24,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:24,873 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 02:57:24,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 02:57:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 02:57:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,875 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:24,875 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 02:57:24,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:24,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-08 02:57:25,124 WARN L456 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-09-08 02:57:25,125 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:25,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1650478471, now seen corresponding path program 1 times [2024-09-08 02:57:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951948955] [2024-09-08 02:57:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951948955] [2024-09-08 02:57:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951948955] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780707091] [2024-09-08 02:57:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:25,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:25,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:25,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-08 02:57:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:25,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 02:57:25,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:25,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:57:25,687 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-09-08 02:57:25,802 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:57:25,806 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-09-08 02:57:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:25,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:26,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:26,033 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:57:26,041 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 33 treesize of output 25 [2024-09-08 02:57:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780707091] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:26,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-08 02:57:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831373684] [2024-09-08 02:57:26,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:26,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-08 02:57:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-08 02:57:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2024-09-08 02:57:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:26,202 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:26,202 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 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-09-08 02:57:26,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:26,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 02:57:26,535 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-08 02:57:26,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-08 02:57:26,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:26,746 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-08 02:57:26,748 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 02:57:26,753 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:26,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 02:57:26,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:26,759 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-09-08 02:57:26,761 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-09-08 02:57:26,762 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 02:57:26,766 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 02:57:26,767 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@36d53a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:26,767 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 02:57:26,817 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:26,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -837336820, now seen corresponding path program 1 times [2024-09-08 02:57:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456693657] [2024-09-08 02:57:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456693657] [2024-09-08 02:57:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456693657] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:26,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:26,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 02:57:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741082809] [2024-09-08 02:57:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:26,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 02:57:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:26,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 02:57:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 02:57:26,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:26,874 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:26,874 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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-09-08 02:57:26,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:26,894 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 02:57:26,895 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:26,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -828712491, now seen corresponding path program 1 times [2024-09-08 02:57:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046543316] [2024-09-08 02:57:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 02:57:26,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 02:57:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 02:57:26,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 02:57:26,928 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 02:57:26,929 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 02:57:26,929 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 02:57:26,930 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-08 02:57:26,930 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 02:57:26,931 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 02:57:26,931 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 02:57:26,956 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 02:57:26,957 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:26,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 02:57:26,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:26,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 02:57:26,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-09-08 02:57:26,964 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 02:57:26,965 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 02:57:26,965 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@36d53a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:26,965 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 02:57:27,137 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:27,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1218277817, now seen corresponding path program 1 times [2024-09-08 02:57:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21043672] [2024-09-08 02:57:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21043672] [2024-09-08 02:57:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21043672] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:27,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:27,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 02:57:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52679423] [2024-09-08 02:57:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:27,179 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 02:57:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 02:57:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 02:57:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,180 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:27,180 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.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-09-08 02:57:27,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:27,222 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 02:57:27,222 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:27,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059173, now seen corresponding path program 1 times [2024-09-08 02:57:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885180883] [2024-09-08 02:57:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:27,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885180883] [2024-09-08 02:57:27,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885180883] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:27,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174391432] [2024-09-08 02:57:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:27,271 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-09-08 02:57:27,272 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-09-08 02:57:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:27,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 02:57:27,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:27,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:27,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174391432] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:27,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 02:57:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667150776] [2024-09-08 02:57:27,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:27,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 02:57:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:27,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 02:57:27,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 02:57:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,442 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:27,442 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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-09-08 02:57:27,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:27,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:27,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-08 02:57:27,687 WARN L456 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-09-08 02:57:27,688 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:27,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -904601861, now seen corresponding path program 1 times [2024-09-08 02:57:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131942061] [2024-09-08 02:57:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131942061] [2024-09-08 02:57:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131942061] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 02:57:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370210816] [2024-09-08 02:57:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:27,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 02:57:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 02:57:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 02:57:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,802 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:27,802 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-09-08 02:57:27,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:27,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:27,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:27,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 02:57:27,846 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:27,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -999344735, now seen corresponding path program 1 times [2024-09-08 02:57:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133511975] [2024-09-08 02:57:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133511975] [2024-09-08 02:57:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133511975] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088899118] [2024-09-08 02:57:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:28,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:28,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:28,067 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-09-08 02:57:28,069 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-09-08 02:57:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:28,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 02:57:28,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:28,313 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-09-08 02:57:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:28,393 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-09-08 02:57:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:28,427 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 19 treesize of output 18 [2024-09-08 02:57:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:28,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:28,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) (or (forall ((|~#m2~0.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))) .cse0))) is different from false [2024-09-08 02:57:28,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:28,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 17 [2024-09-08 02:57:28,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|)))))) is different from false [2024-09-08 02:57:28,651 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_~newTop~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-09-08 02:57:28,666 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-09-08 02:57:28,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:28,679 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-09-08 02:57:28,682 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 206 treesize of output 194 [2024-09-08 02:57:28,687 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 94 treesize of output 88 [2024-09-08 02:57:28,691 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 76 treesize of output 72 [2024-09-08 02:57:28,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:28,728 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-09-08 02:57:28,732 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 30 treesize of output 22 [2024-09-08 02:57:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 02:57:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088899118] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:28,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 22 [2024-09-08 02:57:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518819742] [2024-09-08 02:57:28,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:28,854 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 02:57:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 02:57:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=257, Unknown=4, NotChecked=148, Total=506 [2024-09-08 02:57:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:28,854 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:28,855 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 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-09-08 02:57:28,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:28,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:28,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:28,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 02:57:29,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-08 02:57:29,445 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:29,446 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:29,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -323185154, now seen corresponding path program 1 times [2024-09-08 02:57:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482166946] [2024-09-08 02:57:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:57:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482166946] [2024-09-08 02:57:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482166946] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:29,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 02:57:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162024824] [2024-09-08 02:57:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:29,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 02:57:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:29,563 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:29,563 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-09-08 02:57:29,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:29,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 02:57:29,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 02:57:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:29,714 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 02:57:29,714 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:29,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1323347906, now seen corresponding path program 1 times [2024-09-08 02:57:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557134872] [2024-09-08 02:57:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557134872] [2024-09-08 02:57:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557134872] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193315119] [2024-09-08 02:57:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:30,045 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-09-08 02:57:30,046 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-09-08 02:57:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:30,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 02:57:30,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:30,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:57:30,227 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-09-08 02:57:30,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:57:30,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-09-08 02:57:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:30,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:30,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:30,662 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:57:30,666 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 33 treesize of output 25 [2024-09-08 02:57:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193315119] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:30,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-08 02:57:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236814420] [2024-09-08 02:57:30,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:30,831 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-08 02:57:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:30,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-08 02:57:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=472, Unknown=2, NotChecked=0, Total=552 [2024-09-08 02:57:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:30,833 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:30,833 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 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-09-08 02:57:30,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:30,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:30,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:30,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 02:57:30,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:30,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:31,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-08 02:57:31,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:31,579 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 02:57:31,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1233754093, now seen corresponding path program 1 times [2024-09-08 02:57:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176810420] [2024-09-08 02:57:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 02:57:31,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 02:57:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 02:57:31,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 02:57:31,620 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 02:57:31,620 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 02:57:31,620 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-08 02:57:31,621 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-08 02:57:31,621 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 02:57:31,621 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 02:57:31,622 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 02:57:31,673 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 02:57:31,675 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:31,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 02:57:31,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:31,677 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-09-08 02:57:31,678 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-09-08 02:57:31,680 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 02:57:31,680 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 02:57:31,680 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@36d53a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 02:57:31,680 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 02:57:31,957 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:31,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1653505405, now seen corresponding path program 1 times [2024-09-08 02:57:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590222025] [2024-09-08 02:57:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 02:57:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:32,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590222025] [2024-09-08 02:57:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590222025] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 02:57:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580345023] [2024-09-08 02:57:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:32,012 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 02:57:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 02:57:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 02:57:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,013 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:32,013 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-09-08 02:57:32,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,071 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-08 02:57:32,071 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:32,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1329674543, now seen corresponding path program 1 times [2024-09-08 02:57:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916828248] [2024-09-08 02:57:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916828248] [2024-09-08 02:57:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916828248] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592631260] [2024-09-08 02:57:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:32,121 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:32,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-08 02:57:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:32,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 02:57:32,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:32,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592631260] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:32,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 02:57:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286463742] [2024-09-08 02:57:32,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:32,319 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 02:57:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 02:57:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 02:57:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,320 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:32,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 02:57:32,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:32,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-08 02:57:32,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:32,600 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:32,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash -770286953, now seen corresponding path program 1 times [2024-09-08 02:57:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47561460] [2024-09-08 02:57:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 02:57:32,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:32,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47561460] [2024-09-08 02:57:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47561460] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 02:57:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078195423] [2024-09-08 02:57:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:32,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 02:57:32,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 02:57:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 02:57:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,688 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:32,688 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-09-08 02:57:32,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:32,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:32,837 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-08 02:57:32,837 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:32,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 222230507, now seen corresponding path program 1 times [2024-09-08 02:57:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:32,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408342074] [2024-09-08 02:57:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 02:57:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408342074] [2024-09-08 02:57:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408342074] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 02:57:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286509943] [2024-09-08 02:57:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:32,974 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 02:57:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:32,975 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:32,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-09-08 02:57:32,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:32,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:32,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:32,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:33,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-08 02:57:33,135 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:33,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1791435089, now seen corresponding path program 1 times [2024-09-08 02:57:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847362586] [2024-09-08 02:57:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-08 02:57:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847362586] [2024-09-08 02:57:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847362586] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307148386] [2024-09-08 02:57:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:33,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:33,605 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-09-08 02:57:33,606 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-09-08 02:57:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:33,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-08 02:57:33,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:33,883 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-09-08 02:57:33,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:33,955 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-09-08 02:57:34,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,014 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-09-08 02:57:34,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,063 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-09-08 02:57:34,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,175 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-09-08 02:57:34,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,255 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-09-08 02:57:34,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,388 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-09-08 02:57:34,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,479 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:34,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,573 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:34,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-09-08 02:57:34,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:34,736 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-09-08 02:57:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2024-09-08 02:57:35,060 INFO L349 Elim1Store]: treesize reduction 160, result has 30.1 percent of original size [2024-09-08 02:57:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 70 treesize of output 117 [2024-09-08 02:57:35,112 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2024-09-08 02:57:35,113 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 84 treesize of output 109 [2024-09-08 02:57:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:35,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:35,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-08 02:57:35,833 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:35,839 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:35,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:35,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815))) (let ((.cse1 (store (select .cse2 |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse1) |c_~#top~0.base| (store (select (store .cse2 |c_~#m2~0.base| .cse1) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or .cse0 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse4 |c_~#m2~0.base| (store (select .cse4 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2024-09-08 02:57:36,077 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~state~0 0))) (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse1) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse2 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) (not .cse1)))) is different from false [2024-09-08 02:57:36,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:36,816 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 1 case distinctions, treesize of input 12 treesize of output 8 [2024-09-08 02:57:36,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:36,837 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 520 treesize of output 534 [2024-09-08 02:57:36,845 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 343 treesize of output 339 [2024-09-08 02:57:36,851 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 339 treesize of output 337 [2024-09-08 02:57:36,857 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 337 treesize of output 329 [2024-09-08 02:57:36,864 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 329 treesize of output 327 [2024-09-08 02:57:36,870 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 327 treesize of output 319 [2024-09-08 02:57:36,877 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 319 treesize of output 317 [2024-09-08 02:57:36,883 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 317 treesize of output 313 [2024-09-08 02:57:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307148386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:37,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 48 [2024-09-08 02:57:37,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484895164] [2024-09-08 02:57:37,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:37,105 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-08 02:57:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-08 02:57:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1558, Unknown=23, NotChecked=522, Total=2352 [2024-09-08 02:57:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:37,107 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:37,107 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 02:57:37,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:37,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:37,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:37,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:37,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:37,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~state~0 0))) (let ((.cse7 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse22 |c_~#top~0.base| (store (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) (.cse14 (not (= c_~state~0 1))) (.cse5 (not .cse3))) (let ((.cse6 (or .cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (let ((.cse21 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse20 (store (select (store (store .cse21 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse20) |c_~#top~0.base| (store (select (store (store .cse21 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse20) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store .cse21 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse16 (or .cse7 .cse14))) (let ((.cse1 (and .cse6 .cse16)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 .cse1) (or (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0) .cse1) (= |c_~#top~0.offset| 0) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse4 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse4) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse4) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse5) (forall ((v_DerPreprocessor_7 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse6 (or (and (or .cse7 .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse8 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse5)) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse9 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse5) (or (= c_~next_alloc_idx~0 0) (let ((.cse12 (+ c_~next_alloc_idx~0 2))) (and (or .cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse11 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse10 (store (select (store (store .cse11 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base| (store (select (store (store .cse11 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base|) |c_~#top~0.offset| .cse12)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| .cse12))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse14)))) (not (= |c_thr1Thread2of3ForFork0_push_~newTop~0#1| 0)) (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .cse16 (or .cse0 (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse18 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse17 (store (select (store (store .cse18 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse17) |c_~#top~0.base| (store (select (store (store .cse18 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse17) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse5) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse19 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse19 |c_~#top~0.base| (store (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse14))) (or (= |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)))))))) is different from false [2024-09-08 02:57:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:37,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-08 02:57:38,143 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:38,144 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:38,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash 801107341, now seen corresponding path program 2 times [2024-09-08 02:57:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69844147] [2024-09-08 02:57:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 02:57:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69844147] [2024-09-08 02:57:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69844147] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874066467] [2024-09-08 02:57:38,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 02:57:38,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:38,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:38,355 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-09-08 02:57:38,359 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-09-08 02:57:38,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 02:57:38,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 02:57:38,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 02:57:38,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:38,610 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-09-08 02:57:38,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:38,634 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-09-08 02:57:38,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:38,644 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-09-08 02:57:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:38,651 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-09-08 02:57:38,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:38,661 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 19 treesize of output 18 [2024-09-08 02:57:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 02:57:38,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 02:57:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874066467] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 02:57:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-08 02:57:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359299395] [2024-09-08 02:57:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:38,709 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-08 02:57:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:38,709 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:38,709 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-09-08 02:57:38,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:38,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:38,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:38,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:38,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:38,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:38,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-08 02:57:39,082 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:39,083 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:39,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -765518316, now seen corresponding path program 2 times [2024-09-08 02:57:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931830073] [2024-09-08 02:57:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:39,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931830073] [2024-09-08 02:57:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931830073] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348960276] [2024-09-08 02:57:39,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 02:57:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:39,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:39,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-08 02:57:39,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 02:57:39,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 02:57:39,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-08 02:57:39,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:40,021 INFO L349 Elim1Store]: treesize reduction 96, result has 35.6 percent of original size [2024-09-08 02:57:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 120 [2024-09-08 02:57:40,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 02:57:40,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:40,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 02:57:40,145 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 02:57:40,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 26 [2024-09-08 02:57:40,214 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 02:57:40,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 26 [2024-09-08 02:57:40,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-09-08 02:57:40,300 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-09-08 02:57:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 02:57:40,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 02:57:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348960276] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 02:57:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-09-08 02:57:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707903656] [2024-09-08 02:57:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:40,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:40,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2024-09-08 02:57:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:40,605 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:40,606 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:40,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-08 02:57:41,335 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:41,336 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:41,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 882666815, now seen corresponding path program 1 times [2024-09-08 02:57:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499632287] [2024-09-08 02:57:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 02:57:41,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499632287] [2024-09-08 02:57:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499632287] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:41,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 02:57:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451437060] [2024-09-08 02:57:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:41,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 02:57:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:41,448 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:41,448 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-09-08 02:57:41,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:41,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:41,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:41,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:41,701 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-08 02:57:41,701 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:41,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1259604423, now seen corresponding path program 1 times [2024-09-08 02:57:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307488338] [2024-09-08 02:57:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:57:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307488338] [2024-09-08 02:57:41,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307488338] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370003962] [2024-09-08 02:57:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:41,810 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-09-08 02:57:41,811 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-09-08 02:57:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:41,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 02:57:42,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:57:42,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:57:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370003962] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:42,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-08 02:57:42,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558625318] [2024-09-08 02:57:42,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:42,163 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 02:57:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 02:57:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-08 02:57:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:42,164 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:42,164 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 12 states have internal predecessors, (167), 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-09-08 02:57:42,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:42,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-08 02:57:42,479 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:42,480 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:42,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1176978261, now seen corresponding path program 1 times [2024-09-08 02:57:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731657483] [2024-09-08 02:57:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 02:57:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731657483] [2024-09-08 02:57:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731657483] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080350611] [2024-09-08 02:57:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:42,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:42,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-08 02:57:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:43,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-08 02:57:43,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:43,177 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-09-08 02:57:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,221 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-09-08 02:57:43,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,278 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-09-08 02:57:43,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,322 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-09-08 02:57:43,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,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 16 treesize of output 11 [2024-09-08 02:57:43,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,463 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-09-08 02:57:43,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,536 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-09-08 02:57:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:43,575 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-09-08 02:57:43,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:57:43,608 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 17 treesize of output 13 [2024-09-08 02:57:43,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:57:43,779 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-09-08 02:57:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:43,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:43,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:43,936 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:57:43,937 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 33 treesize of output 25 [2024-09-08 02:57:43,939 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 6 treesize of output 4 [2024-09-08 02:57:44,111 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= c_~next_alloc_idx~0 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) is different from false [2024-09-08 02:57:44,632 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0)) is different from false [2024-09-08 02:57:44,652 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0)) is different from false [2024-09-08 02:57:44,674 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0))))) (or (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0)) (not (= c_~state~0 1)))))) is different from false [2024-09-08 02:57:44,697 WARN L854 $PredicateComparison]: unable to prove that (or (= c_~next_alloc_idx~0 0) (let ((.cse0 (not (= (+ c_~next_alloc_idx~0 2) 0)))) (and (or (not (= c_~state~0 1)) (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0))) (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))))))) is different from false [2024-09-08 02:57:44,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:44,833 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 1 case distinctions, treesize of input 12 treesize of output 8 [2024-09-08 02:57:44,873 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-09-08 02:57:44,874 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 558 treesize of output 566 [2024-09-08 02:57:44,886 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 303 treesize of output 301 [2024-09-08 02:57:44,893 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 301 treesize of output 293 [2024-09-08 02:57:44,901 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 293 treesize of output 289 [2024-09-08 02:57:44,908 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 289 treesize of output 287 [2024-09-08 02:57:44,915 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 287 treesize of output 285 [2024-09-08 02:57:44,923 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 285 treesize of output 281 [2024-09-08 02:57:44,930 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 281 treesize of output 279 [2024-09-08 02:57:44,937 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 279 treesize of output 277 [2024-09-08 02:57:44,945 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 277 treesize of output 273 [2024-09-08 02:57:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 02:57:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080350611] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:45,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 37 [2024-09-08 02:57:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49363639] [2024-09-08 02:57:45,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:45,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-08 02:57:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-08 02:57:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=920, Unknown=19, NotChecked=330, Total=1406 [2024-09-08 02:57:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:45,145 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:45,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2894736842105265) internal successors, (201), 37 states have internal predecessors, (201), 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-09-08 02:57:45,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:45,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:46,182 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_~state~0 0))) (let ((.cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse20 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse20 |c_~#top~0.base| (store (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) (.cse12 (not (= c_~state~0 1))) (.cse3 (not .cse6))) (let ((.cse4 (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (let ((.cse19 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse18 (store (select (store (store .cse19 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse18) |c_~#top~0.base| (store (select (store (store .cse19 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse18) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store .cse19 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse14 (or .cse5 .cse12))) (let ((.cse1 (and .cse4 .cse14)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 .cse1) (or (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0) .cse1) (= |c_~#top~0.offset| 0) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse2 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse3) .cse4 (or (and (or .cse5 .cse6) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse7 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse7) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse7) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse3)) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (or (= c_~next_alloc_idx~0 0) (let ((.cse10 (+ c_~next_alloc_idx~0 2))) (and (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse8 (store (select (store (store .cse9 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base| (store (select (store (store .cse9 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base|) |c_~#top~0.offset| .cse10)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse11 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| .cse10))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse12)))) (or .cse6 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .cse14 (or .cse0 (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse16 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse15 (store (select (store (store .cse16 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse15) |c_~#top~0.base| (store (select (store (store .cse16 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse15) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse17 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse17 |c_~#top~0.base| (store (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse12)))))))) is different from false [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:46,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-09-08 02:57:47,189 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-08 02:57:47,190 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:47,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash 425971427, now seen corresponding path program 1 times [2024-09-08 02:57:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823701196] [2024-09-08 02:57:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-08 02:57:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823701196] [2024-09-08 02:57:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823701196] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:57:47,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:57:47,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 02:57:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055078290] [2024-09-08 02:57:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:57:47,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 02:57:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 02:57:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 02:57:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:47,278 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:47,278 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:47,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:47,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-08 02:57:47,816 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:47,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 701199428, now seen corresponding path program 1 times [2024-09-08 02:57:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225556783] [2024-09-08 02:57:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225556783] [2024-09-08 02:57:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225556783] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:48,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396897966] [2024-09-08 02:57:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:48,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:48,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:48,579 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:48,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-08 02:57:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:48,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-08 02:57:48,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:48,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:57:48,915 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 17 treesize of output 13 [2024-09-08 02:57:49,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 [2024-09-08 02:57:49,064 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-09-08 02:57:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:49,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:49,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:49,249 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:57:49,251 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 33 treesize of output 25 [2024-09-08 02:57:49,253 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 6 treesize of output 4 [2024-09-08 02:57:49,379 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-09-08 02:57:49,379 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 35 treesize of output 39 [2024-09-08 02:57:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396897966] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:49,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2024-09-08 02:57:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144811316] [2024-09-08 02:57:49,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:49,503 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-08 02:57:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-08 02:57:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1270, Unknown=3, NotChecked=0, Total=1406 [2024-09-08 02:57:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:49,504 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:49,504 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 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-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:49,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 02:57:51,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-08 02:57:52,179 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-08 02:57:52,179 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:52,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747720, now seen corresponding path program 1 times [2024-09-08 02:57:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387964255] [2024-09-08 02:57:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:57:52,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:52,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387964255] [2024-09-08 02:57:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387964255] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:52,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109535363] [2024-09-08 02:57:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:52,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:52,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:52,875 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:52,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-08 02:57:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:53,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 02:57:53,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:53,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:57:53,135 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-09-08 02:57:53,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:57:53,234 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-09-08 02:57:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:53,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:53,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:57:53,370 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:57:53,372 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 33 treesize of output 25 [2024-09-08 02:57:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 02:57:53,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109535363] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:53,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:53,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-09-08 02:57:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358998865] [2024-09-08 02:57:53,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:53,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-08 02:57:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-08 02:57:53,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2024-09-08 02:57:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:53,500 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:53,500 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 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-09-08 02:57:53,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:53,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:53,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 02:57:53,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 02:57:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-09-08 02:57:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 02:57:56,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-09-08 02:57:56,878 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-08 02:57:56,878 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:57:56,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:57:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1085853016, now seen corresponding path program 1 times [2024-09-08 02:57:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:57:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600752914] [2024-09-08 02:57:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:57:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 02:57:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:57:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600752914] [2024-09-08 02:57:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600752914] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:57:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9441974] [2024-09-08 02:57:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:57:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:57:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:57:57,272 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:57:57,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-09-08 02:57:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:57:57,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-08 02:57:57,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:57:57,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:57,817 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:57,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-09-08 02:57:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:57,898 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:57,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:57,983 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:57,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:58,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:58,019 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:58,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:58,071 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:58,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:58,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:57:58,108 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:57:58,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:57:58,200 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 02:57:58,203 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 2 case distinctions, treesize of input 37 treesize of output 35 [2024-09-08 02:57:58,220 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 02:57:58,221 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 29 treesize of output 26 [2024-09-08 02:57:58,223 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 11 treesize of output 9 [2024-09-08 02:57:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:57:58,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:57:58,380 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:58,409 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:58,415 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-09-08 02:57:58,463 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-09-08 02:57:58,464 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 69 treesize of output 68 [2024-09-08 02:57:58,466 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 50 treesize of output 46 [2024-09-08 02:57:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-09-08 02:57:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9441974] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:57:58,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:57:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 35 [2024-09-08 02:57:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284000826] [2024-09-08 02:57:58,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:57:58,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-08 02:57:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:57:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-08 02:57:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=927, Unknown=7, NotChecked=192, Total=1260 [2024-09-08 02:57:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:57:58,648 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:57:58,648 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.388888888888889) internal successors, (266), 35 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-08 02:57:58,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-08 02:58:02,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-09-08 02:58:02,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-08 02:58:02,312 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:58:02,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:58:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1994314252, now seen corresponding path program 1 times [2024-09-08 02:58:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:58:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269491414] [2024-09-08 02:58:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:58:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-08 02:58:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:58:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269491414] [2024-09-08 02:58:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269491414] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 02:58:02,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 02:58:02,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 02:58:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184669570] [2024-09-08 02:58:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 02:58:02,543 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 02:58:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:58:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 02:58:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 02:58:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:02,543 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:58:02,544 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-09-08 02:58:02,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-08 02:58:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:03,616 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-08 02:58:03,617 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:58:03,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:58:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1384830022, now seen corresponding path program 1 times [2024-09-08 02:58:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:58:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319530943] [2024-09-08 02:58:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:58:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-08 02:58:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:58:04,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319530943] [2024-09-08 02:58:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319530943] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:58:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140854788] [2024-09-08 02:58:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:04,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:58:04,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:58:04,842 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:58:04,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-08 02:58:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:05,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 02:58:05,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:58:05,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,409 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-09-08 02:58:05,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,424 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-09-08 02:58:05,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,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 16 treesize of output 11 [2024-09-08 02:58:05,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,482 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-09-08 02:58:05,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,543 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:58:05,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-09-08 02:58:05,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:05,599 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:58:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:58:05,606 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:58:05,606 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 17 treesize of output 17 [2024-09-08 02:58:05,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:58:05,807 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 17 treesize of output 12 [2024-09-08 02:58:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 02:58:05,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:58:05,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:58:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 02:58:05,988 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 33 treesize of output 25 [2024-09-08 02:58:05,992 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 6 treesize of output 4 [2024-09-08 02:58:06,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:58:06,144 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 37 treesize of output 37 [2024-09-08 02:58:06,146 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 24 treesize of output 22 [2024-09-08 02:58:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 02:58:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140854788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:58:06,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:58:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 34 [2024-09-08 02:58:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062977163] [2024-09-08 02:58:06,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:58:06,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-08 02:58:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:58:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-08 02:58:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1050, Unknown=6, NotChecked=0, Total=1190 [2024-09-08 02:58:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:06,304 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:58:06,305 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 34 states have internal predecessors, (285), 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-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:06,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:06,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-09-08 02:58:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 02:58:09,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-08 02:58:10,058 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:58:10,059 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:58:10,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:58:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2018876800, now seen corresponding path program 2 times [2024-09-08 02:58:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:58:10,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153168155] [2024-09-08 02:58:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:58:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 02:58:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:58:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153168155] [2024-09-08 02:58:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153168155] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:58:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354139421] [2024-09-08 02:58:10,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 02:58:10,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:58:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:58:10,424 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:58:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-09-08 02:58:10,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 02:58:10,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 02:58:10,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-08 02:58:10,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:58:11,006 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 02:58:11,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-08 02:58:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:58:11,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:58:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:58:11,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354139421] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:58:11,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:58:11,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2024-09-08 02:58:11,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357677853] [2024-09-08 02:58:11,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:58:11,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-08 02:58:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:58:11,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-08 02:58:11,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=644, Unknown=1, NotChecked=0, Total=756 [2024-09-08 02:58:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:11,354 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:58:11,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.25) internal successors, (231), 27 states have internal predecessors, (231), 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-09-08 02:58:11,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:11,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-09-08 02:58:11,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:11,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-09-08 02:58:11,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:11,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 02:58:11,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 02:58:15,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-08 02:58:15,444 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:58:15,444 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:58:15,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:58:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1087457335, now seen corresponding path program 1 times [2024-09-08 02:58:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:58:15,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164563118] [2024-09-08 02:58:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:58:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-08 02:58:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:58:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164563118] [2024-09-08 02:58:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164563118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:58:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934861412] [2024-09-08 02:58:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:58:15,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:58:15,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:58:15,747 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:58:15,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-09-08 02:58:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:58:16,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-08 02:58:16,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:58:16,453 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 02:58:16,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-08 02:58:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:16,515 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:58:16,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 29 [2024-09-08 02:58:16,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:16,600 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:58:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-09-08 02:58:16,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:16,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-09-08 02:58:16,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:58:16,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-09-08 02:58:16,955 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-09-08 02:58:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 77 [2024-09-08 02:58:16,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 02:58:16,994 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 02:58:16,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-09-08 02:58:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 02:58:17,036 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 32 treesize of output 15 [2024-09-08 02:58:17,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:58:17,044 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 15 treesize of output 19 [2024-09-08 02:58:17,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:58:17,224 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 117 treesize of output 145 [2024-09-08 02:58:17,292 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 11 treesize of output 7 [2024-09-08 02:58:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:58:17,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:58:19,395 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_30 (Array Int Int))) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_29 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))))) is different from false [2024-09-08 02:58:19,459 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (= (select .cse0 |c_~#top~0.offset|) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-08 02:58:19,559 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535))) (or (let ((.cse0 (select .cse1 |c_~#top~0.base|))) (= (select .cse0 |c_~#top~0.offset|) (select (select (store (store .cse1 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|))) (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2024-09-08 02:58:19,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_30 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) |c_~#m~0.base| v_ArrVal_2535))) (or (= (select (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (let ((.cse2 (select .cse1 |c_~#top~0.base|))) (= (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535) |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))))))) (or .cse0 (forall ((v_DerPreprocessor_30 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#m~0.base| v_ArrVal_2535))) (or (= (select (select .cse5 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (let ((.cse6 (select .cse5 |c_~#top~0.base|))) (= (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|) (select .cse6 |c_~#top~0.offset|)))))))))) is different from false [2024-09-08 02:58:19,673 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-08 02:58:19,674 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 68 [2024-09-08 02:58:19,683 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-08 02:58:19,683 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 105 treesize of output 93 [2024-09-08 02:58:19,688 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 11 treesize of output 9 [2024-09-08 02:58:19,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:58:19,695 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 15 treesize of output 19 [2024-09-08 02:58:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-09-08 02:58:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934861412] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:58:19,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:58:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 12] total 33 [2024-09-08 02:58:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599966184] [2024-09-08 02:58:19,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:58:19,783 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-08 02:58:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:58:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-08 02:58:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=769, Unknown=9, NotChecked=236, Total=1122 [2024-09-08 02:58:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:19,790 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:58:19,790 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 33 states have internal predecessors, (234), 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-09-08 02:58:19,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:19,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:19,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:58:19,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-09-08 02:58:19,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:58:19,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:58:19,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 02:58:19,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:58:24,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:26,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:29,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:33,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:37,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:39,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:41,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:43,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:45,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:49,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:53,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:58:54,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (select .cse3 |c_~#top~0.offset|)) (.cse5 (select .cse6 0))) (let ((.cse4 (= .cse5 1)) (.cse0 (select .cse3 0)) (.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse2))) (and (= |c_~#m~0.offset| 0) (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (= .cse0 3)) (= |c_~#top~0.offset| 0) (= |c_thr1Thread2of3ForFork0_push_#t~mem13#1| 1) (<= |c_~#m~0.base| 3) (or (not .cse1) (forall ((v_DerPreprocessor_30 (Array Int Int))) (= .cse2 (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|)))) (or (forall ((v_DerPreprocessor_29 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#top~0.base|) |c_~#top~0.offset|) .cse2)) .cse1) .cse4 (or (< |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| 4) .cse4) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0) .cse1 (= 3 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (= .cse5 |c_thr1Thread2of3ForFork0_push_#t~mem13#1|) (or (= |c_~#m~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#m~0.base|))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (<= 4 |c_~#top~0.base|) (= (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))) is different from false [2024-09-08 02:58:56,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 02:59:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-08 02:59:08,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-08 02:59:08,771 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-09-08 02:59:08,772 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:59:08,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:59:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1402148267, now seen corresponding path program 1 times [2024-09-08 02:59:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:59:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526426159] [2024-09-08 02:59:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:59:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:59:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:59:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 02:59:09,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:59:09,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526426159] [2024-09-08 02:59:09,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526426159] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:59:09,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595704376] [2024-09-08 02:59:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:59:09,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:59:09,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:59:09,102 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:59:09,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-08 02:59:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:59:09,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-08 02:59:09,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:59:09,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-08 02:59:09,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:59:09,387 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-09-08 02:59:09,436 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 02:59:09,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 02:59:09,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 02:59:09,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 02:59:09,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:09,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2024-09-08 02:59:09,525 INFO L349 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2024-09-08 02:59:09,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 139 [2024-09-08 02:59:09,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:09,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 02:59:09,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 02:59:09,647 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-08 02:59:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2024-09-08 02:59:09,658 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-09-08 02:59:09,660 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-09-08 02:59:09,664 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-09-08 02:59:09,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:09,682 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-09-08 02:59:09,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 38 [2024-09-08 02:59:09,686 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-09-08 02:59:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:59:09,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:59:17,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_2681 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_2681))) (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))) is different from false [2024-09-08 02:59:17,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:17,197 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 35 treesize of output 37 [2024-09-08 02:59:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 7 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 02:59:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595704376] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 02:59:17,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 02:59:17,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2024-09-08 02:59:17,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307422296] [2024-09-08 02:59:17,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 02:59:17,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-08 02:59:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 02:59:17,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-08 02:59:17,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=350, Unknown=5, NotChecked=38, Total=462 [2024-09-08 02:59:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:59:17,246 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 02:59:17,246 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 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-09-08 02:59:17,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:17,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:17,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:59:17,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 02:59:17,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-09-08 02:59:17,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 02:59:20,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:59:22,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:59:24,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 02:59:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-08 02:59:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 02:59:24,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-09-08 02:59:25,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-09-08 02:59:25,182 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 02:59:25,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 02:59:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1345921391, now seen corresponding path program 1 times [2024-09-08 02:59:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 02:59:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659902900] [2024-09-08 02:59:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:59:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 02:59:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:59:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:59:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 02:59:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659902900] [2024-09-08 02:59:27,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659902900] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 02:59:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791250039] [2024-09-08 02:59:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 02:59:27,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 02:59:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 02:59:27,480 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 02:59:27,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-09-08 02:59:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 02:59:27,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-09-08 02:59:27,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 02:59:27,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 02:59:27,935 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-09-08 02:59:28,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 02:59:28,371 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-09-08 02:59:28,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:28,604 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-09-08 02:59:28,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:28,680 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-09-08 02:59:28,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:28,855 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-09-08 02:59:28,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:28,956 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-09-08 02:59:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:29,235 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-09-08 02:59:29,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2024-09-08 02:59:29,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:29,416 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 02:59:29,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 02:59:29,717 INFO L349 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2024-09-08 02:59:29,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 46 [2024-09-08 02:59:30,037 INFO L349 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2024-09-08 02:59:30,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 115 treesize of output 153 [2024-09-08 02:59:30,227 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-09-08 02:59:30,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:30,231 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-09-08 02:59:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 02:59:30,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 02:59:30,669 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse0 (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse3 (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (not .cse5)) (or .cse5 (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse6 (select .cse7 |c_~#top~0.base|))) (or (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse6 |c_~#top~0.offset|))) (not (= (select (select (store (store .cse7 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:31,119 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse9 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (select .cse9 |c_~#top~0.offset|))) (let ((.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse1))) (and (or (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse0 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse3 (select .cse2 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse2 |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select .cse3 |c_~#top~0.offset|)))))))) .cse4) (or (not .cse4) (let ((.cse7 (store |c_#memory_int| |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse1 (select .cse6 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse8 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= .cse1 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:32,511 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse4 (select .cse3 |c_~#top~0.base|))) (let ((.cse0 (select .cse4 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store .cse3 |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= .cse0 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse5 (select .cse10 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse5)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse9 (store .cse7 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (not (= .cse5 (select .cse6 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse11 (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse11) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse12 (store .cse14 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse13 (select .cse12 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse12 |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse16 (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse16 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse15)))))) (forall ((|~#m~0.offset| Int)) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |~#m~0.offset|) 0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:35,542 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse22 (= c_~state~0 0))) (and (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store .cse4 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse2 (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse1 (select .cse0 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse1 |c_~#top~0.offset|) .cse2)))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2))))) (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse4 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store .cse8 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse6 (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6)))) (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6))))) (not (= (+ (select (select .cse8 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse8 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store .cse9 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10))))))))))) (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store .cse15 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select .cse17 |c_~#top~0.base|))) (let ((.cse16 (select .cse21 |c_~#top~0.offset|))) (or (not (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse20 (store .cse17 |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse18 (store (select .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (select .cse19 |c_~#top~0.offset|) .cse16)))))))))))))) (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse22) (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse27 (select (store .cse23 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse24 (select .cse27 |c_~#top~0.offset|)) (.cse25 (let ((.cse26 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse26 v_prenex_225 (store (select .cse26 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse23 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse23 v_prenex_226) 0) 1) 0)) (not (= .cse24 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse25 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse24 (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse31 (store .cse28 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse29 (store .cse31 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select (store .cse29 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse35 (store .cse33 |c_~#m~0.base| v_prenex_221))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse34 (select (store .cse35 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse32 (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse33 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse32 (select .cse34 |c_~#top~0.offset|))) (not (= (select (select .cse33 |c_~#m~0.base|) v_prenex_223) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse42 (select (store .cse36 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse40 (store (select .cse41 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|)) (.cse38 (select (store .cse41 v_prenex_231 .cse40) |c_~#top~0.base|))) (or (not (= (select (select .cse36 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse37 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse37 (select .cse38 |c_~#top~0.offset|))) (not (= (+ (select (select .cse36 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse39 v_prenex_231 .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))) (not .cse22)))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:36,709 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse7 (select (store .cse1 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse6 (store .cse4 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse5 (store (select .cse6 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (select .cse7 |c_~#top~0.offset|)) (.cse3 (select (store .cse6 v_prenex_231 .cse5) |c_~#top~0.base|))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (+ (select (select .cse1 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse4 v_prenex_231 .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse12 (select (store .cse8 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse9 (select .cse12 |c_~#top~0.offset|)) (.cse10 (let ((.cse11 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse11 v_prenex_225 (store (select .cse11 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse8 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse8 v_prenex_226) 0) 1) 0)) (not (= .cse9 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|))) (= .cse9 (select (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse10 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse16 (store .cse13 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse14 (store .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select .cse13 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select (store .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse20 (store .cse18 |c_~#m~0.base| v_prenex_221))) (let ((.cse17 (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse19 (select (store .cse20 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse17 (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse18 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse17 (select .cse19 |c_~#top~0.offset|))) (not (= (select (select .cse18 |c_~#m~0.base|) v_prenex_223) 0))))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store .cse25 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse21 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse22 (select .cse21 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse21 |c_~#top~0.base| (store .cse22 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse22 |c_~#top~0.offset|) .cse23)))))) (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23))))) (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse26 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse30 (store .cse26 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (let ((.cse27 (select .cse31 |c_~#top~0.offset|))) (or (not (= (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse28 (let ((.cse29 (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27))))))))) (not (= (+ (select (select .cse26 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse26 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse35 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse34 (store .cse35 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse33 (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse32 (store .cse34 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse32 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33)))) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33))))) (not (= (+ (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store .cse36 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:36,976 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse20 (= c_~state~0 0))) (and (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse4 v_prenex_225 (store (select .cse4 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse1 (select .cse3 |c_~#top~0.offset|)) (.cse0 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse0 v_prenex_226) 0) 1) 0)) (= .cse1 (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse2 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse0 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse11 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse10 (store .cse8 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse9 (store (select .cse10 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse5 (select .cse11 |c_~#top~0.offset|)) (.cse7 (select (store .cse10 v_prenex_231 .cse9) |c_~#top~0.base|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse5 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse5 (select .cse7 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse8 v_prenex_231 .cse9) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse6 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse13 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse12 (store .cse15 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse14 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (not (= (+ 1 (select (select .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse14 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse16 (select (store .cse19 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse18 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse17 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse17 v_prenex_220) 0) 1) 0)) (not (= .cse18 (select .cse16 |c_~#top~0.offset|))) (= .cse18 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (not .cse20)) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse21 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse21 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse21 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse22 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse23 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse23 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select .cse29 |c_~#top~0.base|))) (let ((.cse26 (select .cse30 |c_~#top~0.offset|))) (or (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse27 (let ((.cse28 (store .cse29 |c_~#top~0.base| (store .cse30 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse27 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse31 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse31 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse31 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|) .cse32) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse33 (store .cse35 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse34 (select .cse33 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse33 |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse34 |c_~#top~0.offset|) .cse32))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse20))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:37,303 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0)) (.cse6 (+ c_~next_alloc_idx~0 2))) (and (or .cse0 (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse1 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse8 (select .cse4 |c_~#top~0.base|))) (let ((.cse2 (select .cse8 |c_~#top~0.offset|))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse7 (store .cse4 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (not (= (select .cse3 |c_~#top~0.offset|) .cse2)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse16 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse17 (store .cse19 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse18 |c_~#top~0.offset|) .cse16))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse20 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse22 (store .cse23 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21))))))))))))))) (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse26 (select (store .cse27 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse25 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse24 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse24 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse24 v_prenex_220) 0) 1) 0)) (not (= .cse25 (select .cse26 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse26 |c_~#top~0.offset| .cse6)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse25 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse29 (let ((.cse32 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse32 v_prenex_225 (store (select .cse32 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse30 (select .cse31 |c_~#top~0.offset|)) (.cse28 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse28 v_prenex_226) 0) 1) 0)) (not (= (select (select (store .cse29 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse30 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse30 (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse28 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse33 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse35 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (not (= (+ 1 (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse43 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse42 (store .cse37 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse42 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse40 (select .cse43 |c_~#top~0.offset|)) (.cse39 (select (store .cse42 v_prenex_231 .cse38) |c_~#top~0.base|)) (.cse41 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select (store (store (store .cse37 v_prenex_231 .cse38) |c_~#top~0.base| (store .cse39 |c_~#top~0.offset| .cse6)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse40 (select (select .cse41 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse41 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse40 (select .cse39 |c_~#top~0.offset|))) (not (= (+ (select (select .cse41 v_prenex_232) 0) 1) 0)))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:37,729 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-09-08 02:59:38,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) is different from false [2024-09-08 02:59:38,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse52 (select |c_#memory_int| |c_~#top~0.base|)) (.cse53 (= c_~state~0 0))) (let ((.cse1 (not .cse53)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse52 |c_~#top~0.offset|)))) (and (or (not .cse0) (and (or .cse1 (and (forall ((v_prenex_235 Int) (v_prenex_370 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_369 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse5 (store (store .cse8 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse10 (select (store (store (store .cse8 |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse9 (store .cse5 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse6 (store (select .cse9 v_prenex_231) 0 1))) (let ((.cse2 (select .cse10 |c_~#top~0.offset|)) (.cse3 (select (store .cse9 v_prenex_231 .cse6) |c_~#top~0.base|)) (.cse4 (store (store (store .cse8 |c_~#m~0.base| v_prenex_369) |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= .cse2 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse5 v_prenex_231 .cse6) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse4 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse4 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_378 Int) (v_prenex_376 Int) (v_prenex_377 Int) (v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_365 (Array Int Int)) (v_prenex_366 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse15 (store (store (store .cse14 |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371) |c_~#m~0.base| v_prenex_379))) (let ((.cse12 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse11 (store .cse15 v_prenex_378 v_prenex_375)) (.cse13 (store (store (store .cse14 |c_~#m~0.base| v_prenex_365) |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371))) (or (not (= (select (select (store .cse11 v_prenex_377 v_prenex_373) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse12 (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse12 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) v_prenex_376) 0)) (not (= (+ 1 (select (select .cse13 v_prenex_377) 0)) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_367 (Array Int Int)) (v_prenex_368 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse19 (select (store (store (store .cse20 |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse16 (let ((.cse21 (store (store (store .cse20 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse21 v_prenex_225 (store (select .cse21 v_prenex_225) 0 1)))) (.cse17 (store (store (store .cse20 |c_~#m~0.base| v_prenex_367) |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224)) (.cse18 (select .cse19 |c_~#top~0.offset|))) (or (not (= (select (select (store .cse16 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse17 v_prenex_226) 0) 1) 0)) (= (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18) (not (= (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_372 (Array Int Int)) (v_prenex_220 Int) (v_prenex_374 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse26 (store (store (store .cse24 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse22 (store (store (store .cse24 |c_~#m~0.base| v_prenex_372) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218)) (.cse23 (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse25 (select (store .cse26 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse22 |c_~#m~0.base|) v_prenex_223))) (= .cse23 (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store (store (store (store (store .cse24 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse25 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_374) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse22 v_prenex_220) 0) 1) 0)) (not (= .cse23 (select .cse25 |c_~#top~0.offset|)))))))))) (or (let ((.cse33 (store |c_#memory_int| |c_~#top~0.base| (store .cse52 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)))) (and (forall ((v_prenex_359 Int) (v_prenex_361 (Array Int Int)) (v_prenex_362 (Array Int Int)) (v_prenex_364 Int) (v_prenex_363 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_360 Int) (v_prenex_358 (Array Int Int))) (let ((.cse30 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse32 (select (store (store .cse30 |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base|))) (let ((.cse28 (select .cse32 |c_~#top~0.offset|)) (.cse29 (let ((.cse31 (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base| (store .cse32 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse31 v_prenex_359 (store (select .cse31 v_prenex_359) 0 1)))) (.cse27 (store (store .cse30 |c_~#m~0.base| v_prenex_361) |c_~#m2~0.base| v_prenex_358))) (or (not (= (+ (select (select .cse27 v_prenex_360) 0) 1) 0)) (not (= .cse28 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse29 v_prenex_360 v_prenex_362) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse28 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse27 |c_~#m~0.base|) v_prenex_364) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse41 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse37 (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849)) (.cse40 (select (store (store .cse41 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849) |c_~#top~0.base|))) (let ((.cse39 (store .cse37 |c_~#top~0.base| (store .cse40 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse34 (store (store .cse41 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse35 (select .cse40 |c_~#top~0.offset|)) (.cse36 (select (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse34 |c_~#m~0.base|) |~#m~0.offset|))) (not (= (+ (select (select .cse34 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (not (= .cse35 (select .cse36 |c_~#top~0.offset|))) (not (= (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|) .cse35)) (not (= (select (select (store (store (store .cse37 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base| (store .cse36 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_357 Int) (v_prenex_352 Int) (v_prenex_353 Int) (v_prenex_351 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_356 (Array Int Int))) (let ((.cse45 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse46 (store (store .cse45 |c_~#m2~0.base| v_prenex_351) |c_~#m~0.base| v_prenex_355))) (let ((.cse42 (store .cse46 v_prenex_352 v_prenex_356)) (.cse44 (select (select .cse46 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse43 (store (store .cse45 |c_~#m~0.base| v_prenex_354) |c_~#m2~0.base| v_prenex_351))) (or (not (= (select (select (store .cse42 v_prenex_353 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= 0 (select (select .cse43 |c_~#m~0.base|) v_prenex_357))) (= (select (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= (+ (select (select .cse43 v_prenex_353) 0) 1) 0))))))) (forall ((v_prenex_349 (Array Int Int)) (v_prenex_345 Int) (v_prenex_346 Int) (v_prenex_350 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_344 (Array Int Int)) (v_prenex_347 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse51 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse50 (store (store .cse51 |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349))) (let ((.cse49 (select (store .cse50 v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base|)) (.cse47 (store (store .cse51 |c_~#m~0.base| v_prenex_347) |c_~#m2~0.base| v_prenex_344)) (.cse48 (select (select .cse50 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (+ (select (select .cse47 v_prenex_346) 0) 1) 0)) (not (= .cse48 (select .cse49 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349) v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base| (store .cse49 |c_~#top~0.offset| .cse7)) v_prenex_346 v_prenex_348) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse47 |c_~#m~0.base|) v_prenex_350) 0)) (= (select (select .cse47 |c_~#top~0.base|) |c_~#top~0.offset|) .cse48)))))))) .cse53))) (or (and (or (and (forall ((v_prenex_339 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_341 Int) (v_prenex_342 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_340 Int) (v_prenex_343 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_337 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse57 (store (store (store .cse58 |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335) |c_~#m~0.base| v_prenex_343))) (let ((.cse55 (select (select .cse57 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse54 (store (store (store .cse58 |c_~#m~0.base| v_prenex_329) |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335)) (.cse56 (store .cse57 v_prenex_342 v_prenex_339))) (or (not (= (+ (select (select .cse54 v_prenex_341) 0) 1) 0)) (= .cse55 (select (select .cse56 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse55 (select (select .cse54 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse54 |c_~#m~0.base|) v_prenex_340) 0)) (not (= (select (select (store .cse56 v_prenex_341 v_prenex_337) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse61 (store (store .cse64 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse65 (select (store (store (store .cse64 |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse66 (store .cse61 |c_~#top~0.base| (store .cse65 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse62 (store (select .cse66 v_prenex_231) 0 1))) (let ((.cse63 (select (store .cse66 v_prenex_231 .cse62) |c_~#top~0.base|)) (.cse60 (select .cse65 |c_~#top~0.offset|)) (.cse59 (store (store (store .cse64 |c_~#m~0.base| v_prenex_333) |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select .cse59 |c_~#top~0.base|) |c_~#top~0.offset|) .cse60)) (not (= (select (select .cse59 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (select (select (store (store (store .cse61 v_prenex_231 .cse62) |c_~#top~0.base| (store .cse63 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse63 |c_~#top~0.offset|) .cse60)) (not (= (+ (select (select .cse59 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_338 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_prenex_336 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse71 (store (store (store .cse70 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse67 (select (select .cse71 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse69 (select (store .cse71 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse68 (store (store (store .cse70 |c_~#m~0.base| v_prenex_336) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (= .cse67 (select (select .cse68 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select .cse69 |c_~#top~0.offset|) .cse67)) (not (= (select (select (store (store (store (store (store .cse70 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse69 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_338) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse68 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse68 v_prenex_220) 0) 1) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse75 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse77 (select (store (store (store .cse75 |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse73 (select .cse77 |c_~#top~0.offset|)) (.cse74 (let ((.cse76 (store (store (store .cse75 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse77 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse76 v_prenex_225 (store (select .cse76 v_prenex_225) 0 1)))) (.cse72 (store (store (store .cse75 |c_~#m~0.base| v_prenex_331) |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224))) (or (not (= (select (select .cse72 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73)) (= (select (select .cse74 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73) (not (= (select (select (store .cse74 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse72 v_prenex_226) 0) 1) 0)) (not (= (select (select .cse72 |c_~#m~0.base|) v_prenex_229) 0)))))))) .cse1) (or .cse53 (and (forall ((v_prenex_318 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_321 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_316 Int) (v_prenex_315 (Array Int Int)) (v_prenex_317 Int)) (let ((.cse82 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse81 (store (store .cse82 |c_~#m2~0.base| v_prenex_315) |c_~#m~0.base| v_prenex_319))) (let ((.cse79 (store .cse81 v_prenex_316 v_prenex_320)) (.cse78 (store (store .cse82 |c_~#m~0.base| v_prenex_318) |c_~#m2~0.base| v_prenex_315)) (.cse80 (select (select .cse81 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select .cse78 |c_~#m~0.base|) v_prenex_321) 0)) (not (= (select (select (store .cse79 v_prenex_317 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse78 v_prenex_317) 0) 1) 0)) (= (select (select .cse79 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80) (= (select (select .cse78 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse90 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse85 (store (store .cse90 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse89 (select .cse85 |c_~#top~0.base|))) (let ((.cse88 (store .cse85 |c_~#top~0.base| (store .cse89 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse86 (store (select .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse83 (store (store .cse90 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse84 (select .cse89 |c_~#top~0.offset|)) (.cse87 (select (store .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base|))) (or (not (= (select (select .cse83 |c_~#top~0.base|) |c_~#top~0.offset|) .cse84)) (not (= 0 (+ (select (select .cse83 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1))) (not (= (select (select .cse83 |c_~#m~0.base|) |~#m~0.offset|) 0)) (not (= (select (select (store (store (store .cse85 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base| (store .cse87 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse84 (select .cse87 |c_~#top~0.offset|))))))))))) (forall ((v_prenex_327 (Array Int Int)) (v_prenex_323 Int) (v_prenex_324 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_322 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_328 Int)) (let ((.cse97 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse95 (store (store .cse97 |c_~#m2~0.base| v_prenex_322) |c_~#m~0.base| v_prenex_327))) (let ((.cse96 (select .cse95 |c_~#top~0.base|))) (let ((.cse93 (select .cse96 |c_~#top~0.offset|)) (.cse91 (store (store .cse97 |c_~#m~0.base| v_prenex_325) |c_~#m2~0.base| v_prenex_322)) (.cse92 (let ((.cse94 (store .cse95 |c_~#top~0.base| (store .cse96 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse94 v_prenex_323 (store (select .cse94 v_prenex_323) 0 1))))) (or (not (= (+ (select (select .cse91 v_prenex_324) 0) 1) 0)) (= (select (select .cse92 |c_~#top~0.base|) |c_~#top~0.offset|) .cse93) (not (= .cse93 (select (select .cse91 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse91 |c_~#m~0.base|) v_prenex_328) 0)) (not (= (select (select (store .cse92 v_prenex_324 v_prenex_326) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (forall ((v_prenex_314 Int) (v_prenex_308 (Array Int Int)) (v_prenex_310 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_309 Int) (v_prenex_311 (Array Int Int)) (v_prenex_312 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse103 (store (store .cse102 |c_~#m2~0.base| v_prenex_308) |c_~#m~0.base| v_prenex_313))) (let ((.cse100 (store .cse103 v_prenex_309 v_DerPreprocessor_46))) (let ((.cse101 (select .cse100 |c_~#top~0.base|)) (.cse99 (select (select .cse103 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse98 (store (store .cse102 |c_~#m~0.base| v_prenex_311) |c_~#m2~0.base| v_prenex_308))) (or (not (= (+ (select (select .cse98 v_prenex_310) 0) 1) 0)) (= (select (select .cse98 |c_~#top~0.base|) |c_~#top~0.offset|) .cse99) (not (= (select (select (store (store .cse100 |c_~#top~0.base| (store .cse101 |c_~#top~0.offset| .cse7)) v_prenex_310 v_prenex_312) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse101 |c_~#top~0.offset|) .cse99)) (not (= (select (select .cse98 |c_~#m~0.base|) v_prenex_314) 0))))))))))) .cse0)))) is different from false [2024-09-08 02:59:39,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:39,664 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 333724 treesize of output 333012 [2024-09-08 02:59:39,861 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 3438 treesize of output 3338 [2024-09-08 02:59:39,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:39,924 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 3686 treesize of output 3640 [2024-09-08 02:59:39,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:39,978 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 3632 treesize of output 3596 [2024-09-08 02:59:40,026 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 2006 treesize of output 1878 [2024-09-08 02:59:40,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:40,077 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 303 treesize of output 305 [2024-09-08 02:59:40,124 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 250 treesize of output 248 [2024-09-08 02:59:40,364 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 90 treesize of output 88 [2024-09-08 02:59:44,757 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-08 02:59:44,758 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 8535 treesize of output 7243 [2024-09-08 02:59:44,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:44,814 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 5969 treesize of output 5869 [2024-09-08 02:59:44,883 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 2853 treesize of output 2653 [2024-09-08 02:59:44,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:44,931 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 2937 treesize of output 2851 [2024-09-08 02:59:44,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:44,979 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 2805 treesize of output 2763 [2024-09-08 02:59:45,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:45,037 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 211 treesize of output 225 [2024-09-08 02:59:45,138 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 502 treesize of output 470 [2024-09-08 02:59:55,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:55,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 957 treesize of output 960 [2024-09-08 02:59:55,640 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 6 treesize of output 4 [2024-09-08 02:59:55,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:55,654 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 930 treesize of output 932 [2024-09-08 02:59:56,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:56,863 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 129 [2024-09-08 02:59:56,907 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-08 02:59:56,908 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 146437 treesize of output 142209 [2024-09-08 02:59:56,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:56,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:56,978 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 210 [2024-09-08 02:59:56,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 02:59:56,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:56,993 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 196 [2024-09-08 02:59:57,004 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 120 treesize of output 118 [2024-09-08 02:59:57,013 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 107 treesize of output 91 [2024-09-08 02:59:57,021 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 168 treesize of output 152 [2024-09-08 02:59:57,030 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 110 treesize of output 102 [2024-09-08 02:59:57,300 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 02:59:57,307 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 02:59:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2024-09-08 02:59:57,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 02:59:57,350 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-08 02:59:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 7122 treesize of output 6210 [2024-09-08 02:59:57,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 02:59:57,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:57,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6454 treesize of output 6282 [2024-09-08 02:59:57,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:57,593 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 2386 treesize of output 2344 [2024-09-08 02:59:57,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:57,652 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 2390 treesize of output 2308 [2024-09-08 02:59:57,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 02:59:57,699 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 145 treesize of output 147 [2024-09-08 02:59:57,742 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 942 treesize of output 910 [2024-09-08 02:59:59,159 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 1327 treesize of output 1325 [2024-09-08 03:00:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-09-08 03:00:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791250039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:00:02,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 03:00:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 77 [2024-09-08 03:00:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111197108] [2024-09-08 03:00:02,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 03:00:02,984 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-09-08 03:00:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 03:00:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-09-08 03:00:02,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4251, Unknown=72, NotChecked=1410, Total=6006 [2024-09-08 03:00:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:00:02,987 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:00:02,987 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.0128205128205128) internal successors, (235), 77 states have internal predecessors, (235), 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-09-08 03:00:02,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-09-08 03:00:02,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:00:02,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 03:00:02,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 03:00:02,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-09-08 03:00:02,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 03:00:02,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:00:23,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:00:35,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:00:53,638 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse66 (select |c_#memory_int| |c_~#m2~0.base|)) (.cse93 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (select .cse93 |c_~#top~0.offset|)) (.cse45 (select .cse66 0)) (.cse1 (select |c_#memory_int| |c_~#m~0.base|))) (let ((.cse2 (= |c_~#top~0.offset| 0)) (.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse3 (forall ((|~#m~0.offset| Int)) (not (= (select .cse1 |~#m~0.offset|) 0)))) (.cse25 (not (= |c_~#m2~0.base| |c_~#top~0.base|))) (.cse44 (= .cse45 0)) (.cse46 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse5)) (.cse23 (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) (.cse47 (select |c_#memory_int| 4))) (and (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| 1) (not (= |c_thr1Thread2of3ForFork0_push_~newTop~0#1| 1)) .cse0 (<= 3 c_~next_alloc_idx~0) (= (select .cse1 |c_~#m~0.offset|) 0) (= |c_~#m2~0.offset| 0) (= |c_thr1Thread1of3ForFork0_push_#res#1| 1) .cse2 (or .cse3 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse4 (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse4 .cse5) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse6 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse4 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse6 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse13 (select .cse10 |c_~#top~0.base|))) (let ((.cse8 (select .cse13 |c_~#top~0.offset|))) (or (not (= .cse8 .cse5)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse12 (store .cse10 |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse11 (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base|))) (or (not (= .cse8 (select .cse9 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse10 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (let ((.cse15 (select .cse18 |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse14 (let ((.cse16 (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= 0 (select (select (store .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|)))) (= .cse15 (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|))))) (not (= .cse15 .cse5))))))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse19 .cse5) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse20 (store .cse22 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse21 (select .cse20 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse20 |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse19 (select .cse21 |c_~#top~0.offset|))))))))))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0))))) .cse23) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 1) (or (= c_~next_alloc_idx~0 0) (let ((.cse24 (forall ((|v_thr1Thread1of3ForFork0_push_~#casret~0#1.base_53| Int)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#casret~0#1.base_53|) 0))))) (and (or .cse2 .cse24) (or .cse25 .cse24) (or (not (= c_~state~0 0)) .cse24) (or (not (= (+ c_~next_alloc_idx~0 2) 0)) .cse24) (not (= (select |c_#valid| |c_~#top~0.base|) 0)) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) .cse24) (or .cse0 .cse24)))) (<= 1 |c_thr1Thread1of3ForFork0_push_loop_~r~0#1|) (or (and (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select .cse29 |c_~#top~0.base|))) (let ((.cse26 (select .cse30 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse26)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse27 (let ((.cse28 (store .cse29 |c_~#top~0.base| (store .cse30 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse27 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= .cse26 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse36 (select .cse33 |c_~#top~0.base|))) (let ((.cse31 (select .cse36 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse31)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse35 (store .cse33 |c_~#top~0.base| (store .cse36 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse34 (store (select .cse35 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse32 (select (store .cse35 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse34) |c_~#top~0.base|))) (or (not (= .cse31 (select .cse32 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse33 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse34) |c_~#top~0.base| (store .cse32 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse37 (select (select .cse40 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse37) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse38 (store .cse40 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse39 (select .cse38 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse38 |c_~#top~0.base| (store .cse39 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse37 (select .cse39 |c_~#top~0.offset|))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse41 (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse42 (store .cse43 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse41 (select (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse42 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse41)))))) .cse23) (not (= |c_~#m2~0.base| 4)) (or .cse44 (= .cse45 1)) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| 1) .cse46 (not (= |c_~#m~0.base| 4)) (= c_~state~0 1) (= 3 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (= 4 |c_~#top~0.base|) (= (select .cse47 0) 1) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (not (= |c_~#m2~0.base| |c_~#m~0.base|)) (or (and (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse52 (select .cse51 |c_~#top~0.base|))) (let ((.cse48 (select .cse52 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse48)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse49 (let ((.cse50 (store .cse51 |c_~#top~0.base| (store .cse52 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse50 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse50 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= 0 (select (select (store .cse49 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|)))) (= .cse48 (select (select .cse49 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse55 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse58 (select .cse55 |c_~#top~0.base|))) (let ((.cse53 (select .cse58 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse53)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse57 (store .cse55 |c_~#top~0.base| (store .cse58 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse56 (store (select .cse57 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse54 (select (store .cse57 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse56) |c_~#top~0.base|))) (or (not (= .cse53 (select .cse54 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse55 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse56) |c_~#top~0.base| (store .cse54 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse62 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse61 (select (select .cse62 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse59 (store .cse62 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse60 (select .cse59 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse59 |c_~#top~0.base| (store .cse60 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse61 (select .cse60 |c_~#top~0.offset|))))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse61))))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse63 (select (select .cse65 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse64 (store .cse65 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse63 (select (select .cse64 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse64 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse63))))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0))))) .cse3 .cse23) .cse25 (= (select |c_#valid| 4) 1) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) .cse44 (or (< |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| 4) (= (+ 1 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) 0)) 0)) (= |c_thr1Thread3of3ForFork0_push_~newTop~0#1| 5) (not (= |c_~#m2~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) (not (= |c_~#m2~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (= (select .cse66 |c_~#m2~0.offset|) 0) (= .cse5 1) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse71 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse70 (store .cse71 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse69 (select (select .cse70 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse67 (store .cse70 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse68 (select .cse67 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse67 |c_~#top~0.base| (store .cse68 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse68 |c_~#top~0.offset|) .cse69)))))) (= (select (select .cse71 |c_~#top~0.base|) |c_~#top~0.offset|) .cse69))))) (not (= (+ (select (select .cse71 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse71 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse75 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse74 (store .cse75 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse73 (select (select .cse74 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse72 (store .cse74 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse72 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse72 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73)))) (= (select (select .cse75 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73))))) (not (= (+ (select (select .cse75 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse75 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse76 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse76 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse80 (store .cse76 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse81 (select .cse80 |c_~#top~0.base|))) (let ((.cse77 (select .cse81 |c_~#top~0.offset|))) (or (not (= (select (select .cse76 |c_~#top~0.base|) |c_~#top~0.offset|) .cse77)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse78 (let ((.cse79 (store .cse80 |c_~#top~0.base| (store .cse81 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse79 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse79 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse78 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse78 |c_~#top~0.base|) |c_~#top~0.offset|) .cse77))))))))))) (not (= (select (select .cse76 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse82 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse82 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse84 (store .cse82 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse88 (select .cse84 |c_~#top~0.base|))) (let ((.cse83 (select .cse88 |c_~#top~0.offset|))) (or (not (= (select (select .cse82 |c_~#top~0.base|) |c_~#top~0.offset|) .cse83)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse87 (store .cse84 |c_~#top~0.base| (store .cse88 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse85 (store (select .cse87 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse86 (select (store .cse87 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse85) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse84 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse85) |c_~#top~0.base| (store .cse86 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (select .cse86 |c_~#top~0.offset|) .cse83)))))))))))))) (not (= (select (select .cse82 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse23) (or (and (or (let ((.cse91 (store |c_#memory_int| |c_~#top~0.base| (store .cse93 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse89 (store (select .cse91 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse90 (select (store .cse91 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse89) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse89) |c_~#top~0.base| (store .cse90 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse90 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse92 (store .cse91 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse91 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse92 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse92 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (not .cse46)) (or .cse46 (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse95 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse94 (select .cse95 |c_~#top~0.base|))) (or (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse94 |c_~#top~0.offset|))) (not (= (select (select (store (store .cse95 |c_~#top~0.base| (store .cse94 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse96 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse96 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse96 |c_~#top~0.base|) |c_~#top~0.offset|)))))))) .cse23) (= (select .cse47 |c_~#top~0.offset|) 1))))) is different from true [2024-09-08 03:00:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:00:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 03:00:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-08 03:00:54,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-09-08 03:00:55,177 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 03:00:55,178 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:00:55,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:00:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 92829193, now seen corresponding path program 1 times [2024-09-08 03:00:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 03:00:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544835669] [2024-09-08 03:00:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:00:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 03:00:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:00:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 03:00:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 03:00:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544835669] [2024-09-08 03:00:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544835669] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 03:00:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197575373] [2024-09-08 03:00:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:00:56,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 03:00:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:00:56,157 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 03:00:56,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-08 03:00:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:00:56,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-08 03:00:56,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:00:56,753 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 03:00:56,754 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 22 [2024-09-08 03:00:56,803 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-09-08 03:00:56,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 03:00:56,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-09-08 03:00:56,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 03:00:57,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,115 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-09-08 03:00:57,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 42 [2024-09-08 03:00:57,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,202 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-09-08 03:00:57,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2024-09-08 03:00:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,489 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-09-08 03:00:57,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 50 [2024-09-08 03:00:57,494 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-09-08 03:00:57,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:00:57,508 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 17 [2024-09-08 03:00:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,542 INFO L349 Elim1Store]: treesize reduction 61, result has 4.7 percent of original size [2024-09-08 03:00:57,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 36 [2024-09-08 03:00:57,548 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-09-08 03:00:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:00:57,831 INFO L349 Elim1Store]: treesize reduction 168, result has 21.5 percent of original size [2024-09-08 03:00:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 187 [2024-09-08 03:00:57,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:00:57,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:00:57,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:00:58,008 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-08 03:00:58,009 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 3 case distinctions, treesize of input 44 treesize of output 33 [2024-09-08 03:00:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:00:58,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:00:59,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:00:59,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 237 treesize of output 204 [2024-09-08 03:00:59,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:00:59,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 117 treesize of output 102 [2024-09-08 03:01:06,510 INFO L349 Elim1Store]: treesize reduction 195, result has 83.8 percent of original size [2024-09-08 03:01:06,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 92 case distinctions, treesize of input 933 treesize of output 1651 [2024-09-08 03:01:07,198 INFO L349 Elim1Store]: treesize reduction 775, result has 15.0 percent of original size [2024-09-08 03:01:07,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 7743 treesize of output 7547 [2024-09-08 03:01:07,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:07,793 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 1248 treesize of output 1249 [2024-09-08 03:01:07,933 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 1240 treesize of output 1232 [2024-09-08 03:01:08,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:08,101 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 1232 treesize of output 1247 [2024-09-08 03:01:08,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:08,261 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 1222 treesize of output 1213 [2024-09-08 03:01:08,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:08,423 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 1204 treesize of output 1205 [2024-09-08 03:01:08,572 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 1196 treesize of output 1192 [2024-09-08 03:01:08,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:08,737 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 1192 treesize of output 1191 [2024-09-08 03:01:08,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:08,929 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 1182 treesize of output 1185 [2024-09-08 03:01:09,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:09,107 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 1176 treesize of output 1191 [2024-09-08 03:01:09,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:09,279 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 1166 treesize of output 1167 [2024-09-08 03:01:09,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:09,453 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 1158 treesize of output 1161 [2024-09-08 03:01:09,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:09,629 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 1152 treesize of output 1155 [2024-09-08 03:01:09,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:09,808 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 1146 treesize of output 1147 [2024-09-08 03:01:10,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,020 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 1138 treesize of output 1141 [2024-09-08 03:01:10,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,201 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 1132 treesize of output 1135 [2024-09-08 03:01:10,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,383 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 1126 treesize of output 1125 [2024-09-08 03:01:10,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,568 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 1116 treesize of output 1117 [2024-09-08 03:01:10,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,768 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 1108 treesize of output 1123 [2024-09-08 03:01:10,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:10,961 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 1098 treesize of output 1097 [2024-09-08 03:01:11,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:01:11,157 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 1088 treesize of output 1089 [2024-09-08 03:03:03,751 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-09-08 03:03:03,751 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-09-08 03:03:03,752 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-08 03:03:03,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-09-08 03:03:03,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-09-08 03:03:03,957 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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:609) 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$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.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:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) 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) ... 69 more [2024-09-08 03:03:03,965 INFO L158 Benchmark]: Toolchain (without parser) took 342380.47ms. Allocated memory was 159.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 83.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-09-08 03:03:03,965 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.73ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 59.2MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.18ms. Allocated memory is still 159.4MB. Free memory was 59.2MB in the beginning and 56.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 159.4MB. Free memory was 56.6MB in the beginning and 54.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: RCFGBuilder took 706.86ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 54.6MB in the beginning and 138.1MB in the end (delta: -83.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-09-08 03:03:03,966 INFO L158 Benchmark]: TraceAbstraction took 341111.21ms. Allocated memory was 220.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 138.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-09-08 03:03:03,967 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.73ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 59.2MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.18ms. Allocated memory is still 159.4MB. Free memory was 59.2MB in the beginning and 56.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 159.4MB. Free memory was 56.6MB in the beginning and 54.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 706.86ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 54.6MB in the beginning and 138.1MB in the end (delta: -83.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 341111.21ms. Allocated memory was 220.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 138.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 173, Maximal queried relation: 0, Independence queries for same thread: 54, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 74, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 412, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 173, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0, Independence queries for same thread: 10, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 20, Number of trivial persistent sets: 18, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 258, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 75, dependent conditional: 32, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 235, independent: 118, independent conditional: 3, independent unconditional: 115, dependent: 117, dependent conditional: 27, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 637, Maximal queried relation: 5, Independence queries for same thread: 65, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 69, Number of trivial persistent sets: 57, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1415, independent conditional: 0, independent unconditional: 1415, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 75, dependent conditional: 32, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 235, independent: 118, independent conditional: 3, independent unconditional: 115, dependent: 117, dependent conditional: 27, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 637, Maximal queried relation: 5, Independence queries for same thread: 65 - 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-09-08 03:03:04,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2024-09-08 03:03:04,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:04,397 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-09-08 03:03:04,597 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/pthread-ext/26_stack_cas_longer-1.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas_longer-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 03:03:06,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 03:03:06,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-08 03:03:06,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 03:03:06,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 03:03:06,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 03:03:06,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 03:03:06,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 03:03:06,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 03:03:06,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 03:03:06,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 03:03:06,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 03:03:06,962 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 03:03:06,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 03:03:06,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 03:03:06,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 03:03:06,965 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-08 03:03:06,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 03:03:06,965 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-08 03:03:06,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 03:03:06,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 03:03:06,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 03:03:06,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 03:03:06,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 03:03:06,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 03:03:06,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 03:03:06,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 03:03:06,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 03:03:06,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 03:03:06,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 03:03:06,969 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-08 03:03:06,970 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 03:03:06,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-08 03:03:06,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 03:03:06,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 03:03:06,970 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 03:03:06,971 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 03:03:06,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-08 03:03:06,972 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-09-08 03:03:07,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 03:03:07,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 03:03:07,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 03:03:07,262 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 03:03:07,262 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 03:03:07,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/26_stack_cas_longer-1.yml/witness.yml [2024-09-08 03:03:07,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 03:03:07,303 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 03:03:07,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 03:03:08,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 03:03:08,875 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 03:03:08,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 03:03:08,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/88c99455f/caca18d286bd4db984072b689a2f61d2/FLAGd69e775e4 [2024-09-08 03:03:09,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/88c99455f/caca18d286bd4db984072b689a2f61d2 [2024-09-08 03:03:09,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 03:03:09,259 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 03:03:09,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 03:03:09,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 03:03:09,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 03:03:09,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 03:03:07" (1/2) ... [2024-09-08 03:03:09,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@841a9b1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 03:03:09, skipping insertion in model container [2024-09-08 03:03:09,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 03:03:07" (1/2) ... [2024-09-08 03:03:09,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@373e8bb1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 03:03:09, skipping insertion in model container [2024-09-08 03:03:09,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:03:09" (2/2) ... [2024-09-08 03:03:09,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@841a9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09, skipping insertion in model container [2024-09-08 03:03:09,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:03:09" (2/2) ... [2024-09-08 03:03:09,291 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 03:03:09,291 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-08 03:03:09,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 03:03:09,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 03:03:09,653 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 03:03:09,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 03:03:09,827 INFO L204 MainTranslator]: Completed translation [2024-09-08 03:03:09,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09 WrapperNode [2024-09-08 03:03:09,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 03:03:09,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 03:03:09,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 03:03:09,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 03:03:09,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,872 INFO L138 Inliner]: procedures = 183, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 197 [2024-09-08 03:03:09,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 03:03:09,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 03:03:09,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 03:03:09,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 03:03:09,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 03:03:09,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 03:03:09,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 03:03:09,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 03:03:09,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (1/1) ... [2024-09-08 03:03:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 03:03:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:03:09,928 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-09-08 03:03:09,934 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-09-08 03:03:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-08 03:03:09,965 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 03:03:09,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 03:03:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 03:03:09,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 03:03:09,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 03:03:09,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 03:03:09,968 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 03:03:10,101 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 03:03:10,103 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 03:03:10,360 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 03:03:10,360 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 03:03:10,602 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 03:03:10,602 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-08 03:03:10,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:03:10 BoogieIcfgContainer [2024-09-08 03:03:10,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 03:03:10,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 03:03:10,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 03:03:10,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 03:03:10,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 03:03:07" (1/4) ... [2024-09-08 03:03:10,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f5fb1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 03:03:10, skipping insertion in model container [2024-09-08 03:03:10,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:03:09" (2/4) ... [2024-09-08 03:03:10,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f5fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:03:10, skipping insertion in model container [2024-09-08 03:03:10,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:03:09" (3/4) ... [2024-09-08 03:03:10,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615f5fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:03:10, skipping insertion in model container [2024-09-08 03:03:10,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:03:10" (4/4) ... [2024-09-08 03:03:10,609 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-09-08 03:03:10,620 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 03:03:10,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 03:03:10,621 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 03:03:10,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 03:03:10,702 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:10,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 03:03:10,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:03:10,704 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-09-08 03:03:10,709 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-09-08 03:03:10,735 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 03:03:10,753 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 03:03:10,758 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@37886ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:10,758 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 03:03:10,866 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:10,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1114168855, now seen corresponding path program 1 times [2024-09-08 03:03:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273402225] [2024-09-08 03:03:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:10,882 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-09-08 03:03:10,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:10,903 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-09-08 03:03:10,907 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-09-08 03:03:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:11,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 03:03:11,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:11,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:11,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:11,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273402225] [2024-09-08 03:03:11,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273402225] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 03:03:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789700139] [2024-09-08 03:03:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:11,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 03:03:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 03:03:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 03:03:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:11,088 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:11,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:03:11,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:11,161 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-09-08 03:03:11,358 WARN L456 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-09-08 03:03:11,358 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:11,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -148017800, now seen corresponding path program 1 times [2024-09-08 03:03:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689260972] [2024-09-08 03:03:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:11,362 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-09-08 03:03:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:11,364 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-09-08 03:03:11,366 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-09-08 03:03:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:11,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 03:03:11,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:11,557 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-09-08 03:03:11,626 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-09-08 03:03:11,656 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 19 treesize of output 18 [2024-09-08 03:03:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:11,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:11,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689260972] [2024-09-08 03:03:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689260972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:11,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 03:03:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810502039] [2024-09-08 03:03:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:11,736 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:11,738 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:11,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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-09-08 03:03:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:11,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:11,824 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 (4)] Ended with exit code 0 [2024-09-08 03:03:12,020 WARN L456 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-09-08 03:03:12,021 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:12,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1592448670, now seen corresponding path program 1 times [2024-09-08 03:03:12,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034497915] [2024-09-08 03:03:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:12,038 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-09-08 03:03:12,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:12,040 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-09-08 03:03:12,041 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-09-08 03:03:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:12,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 03:03:12,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:12,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 03:03:12,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-09-08 03:03:12,191 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-09-08 03:03:12,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:03:12,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-08 03:03:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 03:03:12,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:12,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034497915] [2024-09-08 03:03:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034497915] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 03:03:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100325753] [2024-09-08 03:03:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:12,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:12,223 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:12,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-09-08 03:03:12,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:12,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,381 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-09-08 03:03:12,577 WARN L456 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-09-08 03:03:12,578 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:12,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1754051290, now seen corresponding path program 1 times [2024-09-08 03:03:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251329083] [2024-09-08 03:03:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:12,581 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-09-08 03:03:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:12,589 INFO L229 MonitoredProcess]: Starting monitored process 6 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-09-08 03:03:12,590 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 (6)] Waiting until timeout for monitored process [2024-09-08 03:03:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:12,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 03:03:12,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:12,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:12,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:12,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251329083] [2024-09-08 03:03:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251329083] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:12,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 03:03:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986054884] [2024-09-08 03:03:12,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:12,785 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 03:03:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 03:03:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 03:03:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:12,786 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:12,786 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:03:12,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:12,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:12,872 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 (6)] Ended with exit code 0 [2024-09-08 03:03:13,067 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-09-08 03:03:13,068 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:13,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2130591545, now seen corresponding path program 1 times [2024-09-08 03:03:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488354889] [2024-09-08 03:03:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:13,071 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-09-08 03:03:13,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:13,077 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-09-08 03:03:13,078 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-09-08 03:03:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:13,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 03:03:13,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:13,265 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:03:13,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 13 treesize of output 13 [2024-09-08 03:03:13,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:03:13,380 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-09-08 03:03:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:13,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:13,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-09-08 03:03:13,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:13,497 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 03:03:13,500 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 33 treesize of output 25 [2024-09-08 03:03:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:13,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:13,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488354889] [2024-09-08 03:03:13,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488354889] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:13,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:13,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-09-08 03:03:13,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971212564] [2024-09-08 03:03:13,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:13,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 03:03:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 03:03:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-09-08 03:03:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:13,654 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:13,654 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 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-09-08 03:03:13,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:13,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:03:13,987 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-08 03:03:13,993 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 (7)] Ended with exit code 0 [2024-09-08 03:03:14,190 WARN L456 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-09-08 03:03:14,199 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-08 03:03:14,200 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 03:03:14,202 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:14,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 03:03:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:03:14,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 03:03:14,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-09-08 03:03:14,210 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 03:03:14,211 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 03:03:14,211 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@37886ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:14,211 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 03:03:14,279 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:14,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1614565434, now seen corresponding path program 1 times [2024-09-08 03:03:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20497013] [2024-09-08 03:03:14,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:14,280 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-09-08 03:03:14,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:14,284 INFO L229 MonitoredProcess]: Starting monitored process 9 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-09-08 03:03:14,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 (9)] Waiting until timeout for monitored process [2024-09-08 03:03:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:14,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 03:03:14,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:14,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:14,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20497013] [2024-09-08 03:03:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20497013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:14,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:14,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 03:03:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612874556] [2024-09-08 03:03:14,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:14,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 03:03:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:14,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 03:03:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 03:03:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:14,363 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:14,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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-09-08 03:03:14,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:14,389 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 (9)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:14,588 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-09-08 03:03:14,588 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1917162261, now seen corresponding path program 1 times [2024-09-08 03:03:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356159018] [2024-09-08 03:03:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:14,590 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-09-08 03:03:14,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:14,592 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-09-08 03:03:14,593 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-09-08 03:03:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 03:03:14,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 03:03:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 03:03:14,717 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 03:03:14,717 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 03:03:14,718 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 03:03:14,723 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-09-08 03:03:14,918 WARN L456 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-09-08 03:03:14,919 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-08 03:03:14,920 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 03:03:14,920 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 03:03:14,920 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 03:03:14,969 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 03:03:14,973 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 03:03:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:03:14,975 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-09-08 03:03:14,977 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-09-08 03:03:14,979 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 03:03:14,979 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 03:03:14,980 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@37886ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:14,980 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 03:03:15,300 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:15,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -826269901, now seen corresponding path program 1 times [2024-09-08 03:03:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450782222] [2024-09-08 03:03:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:15,302 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-09-08 03:03:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:15,305 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-09-08 03:03:15,306 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-09-08 03:03:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:15,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 03:03:15,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 03:03:15,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:15,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450782222] [2024-09-08 03:03:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450782222] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 03:03:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469746210] [2024-09-08 03:03:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:15,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 03:03:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 03:03:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 03:03:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:15,436 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:15,436 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.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-09-08 03:03:15,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:15,497 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 (12)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:15,688 WARN L456 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-09-08 03:03:15,689 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:15,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1039106021, now seen corresponding path program 1 times [2024-09-08 03:03:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:15,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698387569] [2024-09-08 03:03:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:15,690 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-09-08 03:03:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:15,692 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-09-08 03:03:15,693 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-09-08 03:03:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:15,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 03:03:15,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:15,783 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-09-08 03:03:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 03:03:15,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:15,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698387569] [2024-09-08 03:03:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698387569] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 03:03:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994983712] [2024-09-08 03:03:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:15,809 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 03:03:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:15,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 03:03:15,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 03:03:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:15,810 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:15,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-09-08 03:03:15,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:15,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:17,852 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 [0] [2024-09-08 03:03:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:17,946 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-09-08 03:03:18,144 WARN L456 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-09-08 03:03:18,145 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:18,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash -210511263, now seen corresponding path program 1 times [2024-09-08 03:03:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649886668] [2024-09-08 03:03:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:18,146 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-09-08 03:03:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:18,148 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-09-08 03:03:18,149 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-09-08 03:03:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:18,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 03:03:18,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:18,345 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-09-08 03:03:18,401 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-09-08 03:03:18,427 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 19 treesize of output 18 [2024-09-08 03:03:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:18,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:18,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:18,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 17 [2024-09-08 03:03:18,628 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (or (not (= (_ bv0 32) (select v_arrayElimArr_4 |~#m2~0.offset|))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_4) |c_~#m~0.base|) |c_~#m~0.offset|)))) (or (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_6) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_214) |c_~#top~0.base| v_DerPreprocessor_6) |c_~#m2~0.base|) |~#m2~0.offset| (_ bv0 32))) |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (_ bv0 32) c_~state~0)))) is different from false [2024-09-08 03:03:18,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:18,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-09-08 03:03:18,720 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 30 treesize of output 22 [2024-09-08 03:03:18,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:18,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-09-08 03:03:18,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 03:03:18,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2024-09-08 03:03:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 03:03:18,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649886668] [2024-09-08 03:03:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649886668] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:18,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-08 03:03:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349360795] [2024-09-08 03:03:18,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:18,840 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 03:03:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 03:03:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-09-08 03:03:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:18,841 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:18,841 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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-09-08 03:03:18,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:18,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:18,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:21,108 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 [0] [2024-09-08 03:03:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:21,228 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 (14)] Ended with exit code 0 [2024-09-08 03:03:21,424 WARN L456 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-09-08 03:03:21,424 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:21,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -240740414, now seen corresponding path program 1 times [2024-09-08 03:03:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:21,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282581770] [2024-09-08 03:03:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:21,425 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-09-08 03:03:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:21,428 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-09-08 03:03:21,428 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-09-08 03:03:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:21,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 03:03:21,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:21,610 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 03:03:21,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 03:03:21,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:03:21,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:03:21,660 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 16 treesize of output 5 [2024-09-08 03:03:21,663 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-09-08 03:03:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 03:03:21,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:21,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282581770] [2024-09-08 03:03:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282581770] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:21,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 03:03:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513201634] [2024-09-08 03:03:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:21,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:21,682 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:21,682 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-09-08 03:03:21,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:21,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:21,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:21,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:21,932 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 (15)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:22,126 WARN L456 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-09-08 03:03:22,127 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:22,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1541764542, now seen corresponding path program 1 times [2024-09-08 03:03:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630782058] [2024-09-08 03:03:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:22,128 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-09-08 03:03:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:22,130 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-09-08 03:03:22,131 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-09-08 03:03:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:22,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 03:03:22,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:22,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:22,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630782058] [2024-09-08 03:03:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630782058] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:22,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 03:03:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053879479] [2024-09-08 03:03:22,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:22,379 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 03:03:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 03:03:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 03:03:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:22,380 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:22,380 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:03:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:22,491 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-09-08 03:03:22,690 WARN L456 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-09-08 03:03:22,690 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:22,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2137440580, now seen corresponding path program 1 times [2024-09-08 03:03:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236164035] [2024-09-08 03:03:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:22,691 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-09-08 03:03:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:22,694 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-09-08 03:03:22,696 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-09-08 03:03:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:22,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 03:03:22,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:22,905 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:03:22,906 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-09-08 03:03:23,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:03:23,057 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-09-08 03:03:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:23,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:23,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-09-08 03:03:23,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:23,224 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 03:03:23,226 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 33 treesize of output 25 [2024-09-08 03:03:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:23,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236164035] [2024-09-08 03:03:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236164035] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:23,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:23,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 03:03:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846076021] [2024-09-08 03:03:23,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:23,434 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 03:03:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 03:03:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-08 03:03:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:23,435 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:23,435 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 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-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:23,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 03:03:24,103 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-09-08 03:03:24,302 WARN L456 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-09-08 03:03:24,303 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:24,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 460945972, now seen corresponding path program 2 times [2024-09-08 03:03:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739975029] [2024-09-08 03:03:24,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 03:03:24,303 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-09-08 03:03:24,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:24,310 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-09-08 03:03:24,311 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-09-08 03:03:24,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 03:03:24,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 03:03:24,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 03:03:24,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:24,534 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:03:24,535 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-09-08 03:03:24,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:03:24,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 16 treesize of output 11 [2024-09-08 03:03:24,775 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-09-08 03:03:24,788 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-09-08 03:03:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:24,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:24,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-08 03:03:24,885 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse0))))) is different from false [2024-09-08 03:03:24,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:24,908 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-09-08 03:03:24,910 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 65 treesize of output 57 [2024-09-08 03:03:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:25,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739975029] [2024-09-08 03:03:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739975029] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:25,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-09-08 03:03:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002576572] [2024-09-08 03:03:25,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:25,202 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-08 03:03:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-08 03:03:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=150, Unknown=2, NotChecked=50, Total=240 [2024-09-08 03:03:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:25,203 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:25,203 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 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-09-08 03:03:25,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:25,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:25,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:25,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:25,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:25,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 03:03:25,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 03:03:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:03:25,667 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-09-08 03:03:25,863 WARN L456 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-09-08 03:03:25,863 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 03:03:25,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -956094227, now seen corresponding path program 1 times [2024-09-08 03:03:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144619298] [2024-09-08 03:03:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:25,864 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-09-08 03:03:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:25,866 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-09-08 03:03:25,867 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-09-08 03:03:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 03:03:25,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 03:03:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 03:03:26,104 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 03:03:26,104 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 03:03:26,104 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 03:03:26,110 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-09-08 03:03:26,305 WARN L456 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-09-08 03:03:26,306 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-08 03:03:26,306 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 03:03:26,307 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 03:03:26,307 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 03:03:26,342 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 03:03:26,346 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 03:03:26,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 03:03:26,347 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-09-08 03:03:26,349 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-09-08 03:03:26,352 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 03:03:26,352 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 03:03:26,352 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@37886ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 03:03:26,352 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 03:03:26,929 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:26,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2126375043, now seen corresponding path program 1 times [2024-09-08 03:03:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582755620] [2024-09-08 03:03:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:26,930 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-09-08 03:03:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:26,933 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-09-08 03:03:26,934 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-09-08 03:03:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:27,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 03:03:27,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 03:03:27,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:27,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582755620] [2024-09-08 03:03:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582755620] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 03:03:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807713425] [2024-09-08 03:03:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:27,105 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 03:03:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:27,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 03:03:27,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 03:03:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:27,106 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:27,106 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-09-08 03:03:27,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:27,214 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 (21)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:27,413 WARN L456 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-09-08 03:03:27,414 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:27,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1980207569, now seen corresponding path program 1 times [2024-09-08 03:03:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618937296] [2024-09-08 03:03:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:27,415 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-09-08 03:03:27,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:27,416 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-09-08 03:03:27,419 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-09-08 03:03:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:27,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 03:03:27,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:27,577 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-09-08 03:03:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 03:03:27,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:27,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618937296] [2024-09-08 03:03:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618937296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:27,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:27,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 03:03:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852188939] [2024-09-08 03:03:27,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:27,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 03:03:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 03:03:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 03:03:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:27,607 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:27,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-09-08 03:03:27,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:27,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:29,660 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 [0] [2024-09-08 03:03:31,738 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 [0] [2024-09-08 03:03:33,778 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 [0] [2024-09-08 03:03:35,936 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 [0] [2024-09-08 03:03:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:35,998 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 (22)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:36,193 WARN L456 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-09-08 03:03:36,194 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:36,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1145783191, now seen corresponding path program 1 times [2024-09-08 03:03:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628231092] [2024-09-08 03:03:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:36,195 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-09-08 03:03:36,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:36,198 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-09-08 03:03:36,199 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-09-08 03:03:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:36,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 03:03:36,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 03:03:36,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 03:03:36,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628231092] [2024-09-08 03:03:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628231092] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:36,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 03:03:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296919707] [2024-09-08 03:03:36,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:36,448 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 03:03:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 03:03:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 03:03:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:36,448 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:36,449 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-09-08 03:03:36,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:36,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:36,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:36,618 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 (23)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:36,813 WARN L456 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-09-08 03:03:36,814 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:36,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 455569771, now seen corresponding path program 1 times [2024-09-08 03:03:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392031033] [2024-09-08 03:03:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:36,814 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-09-08 03:03:36,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:36,816 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-09-08 03:03:36,818 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-09-08 03:03:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:36,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 03:03:37,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:37,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 03:03:37,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-09-08 03:03:37,057 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-09-08 03:03:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:03:37,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-08 03:03:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 03:03:37,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:37,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392031033] [2024-09-08 03:03:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392031033] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 03:03:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568817810] [2024-09-08 03:03:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:37,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:37,086 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:37,087 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-09-08 03:03:37,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:37,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:37,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:37,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:37,394 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 (24)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:37,589 WARN L456 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-09-08 03:03:37,589 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:37,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1522923375, now seen corresponding path program 1 times [2024-09-08 03:03:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142371273] [2024-09-08 03:03:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:37,590 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-09-08 03:03:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:37,593 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-09-08 03:03:37,593 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-09-08 03:03:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:37,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 03:03:37,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:37,844 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-09-08 03:03:37,900 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-09-08 03:03:37,954 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 19 treesize of output 18 [2024-09-08 03:03:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-08 03:03:37,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:38,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:38,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 17 [2024-09-08 03:03:38,150 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (or (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_14) |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_14 |~#m2~0.offset|))))) (or (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_630) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |~#m2~0.offset| (_ bv0 32))) |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (_ bv0 32) c_~state~0)))) is different from false [2024-09-08 03:03:38,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:38,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-09-08 03:03:38,222 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 102 treesize of output 94 [2024-09-08 03:03:38,234 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 93 treesize of output 89 [2024-09-08 03:03:38,238 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 91 treesize of output 85 [2024-09-08 03:03:38,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:38,282 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-09-08 03:03:38,287 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 30 treesize of output 22 [2024-09-08 03:03:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-09-08 03:03:38,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:38,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142371273] [2024-09-08 03:03:38,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142371273] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:38,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:38,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-08 03:03:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037976470] [2024-09-08 03:03:38,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:38,378 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 03:03:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 03:03:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-09-08 03:03:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:38,379 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:38,379 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:03:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:38,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:39,021 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 (25)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:39,216 WARN L456 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-09-08 03:03:39,216 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:39,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1452080061, now seen corresponding path program 1 times [2024-09-08 03:03:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186416218] [2024-09-08 03:03:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:39,217 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-09-08 03:03:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:39,218 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09-08 03:03:39,220 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 (26)] Waiting until timeout for monitored process [2024-09-08 03:03:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:39,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 03:03:39,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:39,424 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 03:03:39,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 03:03:39,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:03:39,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:03:39,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 03:03:39,459 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-08 03:03:39,463 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-09-08 03:03:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 03:03:39,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:39,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186416218] [2024-09-08 03:03:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186416218] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:39,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:39,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 03:03:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666992352] [2024-09-08 03:03:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:39,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:39,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:39,480 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:39,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:39,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:39,922 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 (26)] Ended with exit code 0 [2024-09-08 03:03:40,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-09-08 03:03:40,115 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:40,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1179436776, now seen corresponding path program 1 times [2024-09-08 03:03:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356300861] [2024-09-08 03:03:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:40,116 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-09-08 03:03:40,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:40,119 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-09-08 03:03:40,120 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-09-08 03:03:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:40,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 03:03:40,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:40,391 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:03:40,391 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-09-08 03:03:40,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:03:40,523 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-09-08 03:03:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 03:03:40,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:40,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#top~0.base|) |c_~#top~0.offset|)))) .cse0) (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse0))))) is different from false [2024-09-08 03:03:40,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:40,674 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-08 03:03:40,676 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 33 treesize of output 25 [2024-09-08 03:03:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 03:03:40,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356300861] [2024-09-08 03:03:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356300861] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:40,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 03:03:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100526538] [2024-09-08 03:03:40,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:40,930 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 03:03:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:40,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 03:03:40,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-08 03:03:40,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:40,931 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:40,931 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-09-08 03:03:40,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:40,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:40,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:40,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:40,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:40,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:40,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:41,751 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-09-08 03:03:41,946 WARN L456 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-09-08 03:03:41,946 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:41,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1258041184, now seen corresponding path program 2 times [2024-09-08 03:03:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904410327] [2024-09-08 03:03:41,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 03:03:41,947 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-09-08 03:03:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:41,956 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-09-08 03:03:41,961 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-09-08 03:03:42,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 03:03:42,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 03:03:42,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 03:03:42,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:42,380 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-09-08 03:03:42,419 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-09-08 03:03:42,431 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 19 treesize of output 18 [2024-09-08 03:03:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 03:03:42,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:03:42,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:42,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904410327] [2024-09-08 03:03:42,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904410327] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:03:42,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:03:42,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 03:03:42,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802191207] [2024-09-08 03:03:42,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:03:42,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:03:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:42,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:03:42,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:03:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:42,479 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:42,479 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-09-08 03:03:42,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:42,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:42,958 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-09-08 03:03:43,151 WARN L456 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-09-08 03:03:43,151 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:43,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1390433366, now seen corresponding path program 1 times [2024-09-08 03:03:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423233581] [2024-09-08 03:03:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:43,152 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-09-08 03:03:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:43,153 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-09-08 03:03:43,154 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-09-08 03:03:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:43,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 03:03:43,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:43,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:43,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423233581] [2024-09-08 03:03:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423233581] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:43,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-09-08 03:03:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855117069] [2024-09-08 03:03:43,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:43,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 03:03:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:43,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 03:03:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-08 03:03:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:43,681 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:43,681 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 11 states have internal predecessors, (156), 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-09-08 03:03:43,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:43,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:44,102 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 (29)] Ended with exit code 0 [2024-09-08 03:03:44,296 WARN L456 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-09-08 03:03:44,296 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:44,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1311039028, now seen corresponding path program 1 times [2024-09-08 03:03:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659906734] [2024-09-08 03:03:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:44,297 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-09-08 03:03:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:44,299 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-09-08 03:03:44,300 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-09-08 03:03:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:44,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 03:03:44,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:44,777 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 03:03:44,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-08 03:03:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:44,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:45,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:45,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659906734] [2024-09-08 03:03:45,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659906734] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:45,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:45,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-09-08 03:03:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432169086] [2024-09-08 03:03:45,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:45,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-08 03:03:45,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-08 03:03:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=279, Unknown=2, NotChecked=0, Total=342 [2024-09-08 03:03:45,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:45,176 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:45,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:45,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:45,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:45,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:45,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:45,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 03:03:46,107 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 (30)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:46,297 WARN L456 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-09-08 03:03:46,298 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:46,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 585131588, now seen corresponding path program 2 times [2024-09-08 03:03:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176844469] [2024-09-08 03:03:46,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 03:03:46,298 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-09-08 03:03:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:46,301 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-09-08 03:03:46,304 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-09-08 03:03:46,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 03:03:46,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 03:03:46,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 03:03:46,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:46,645 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:03:46,646 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-09-08 03:03:46,878 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:03:46,882 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-09-08 03:03:46,975 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-09-08 03:03:46,997 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-09-08 03:03:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 03:03:47,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:47,185 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-09-08 03:03:47,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:47,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-09-08 03:03:47,207 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 65 treesize of output 57 [2024-09-08 03:03:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 03:03:47,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176844469] [2024-09-08 03:03:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176844469] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:47,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-09-08 03:03:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493491571] [2024-09-08 03:03:47,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:47,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-08 03:03:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-08 03:03:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=273, Unknown=12, NotChecked=34, Total=380 [2024-09-08 03:03:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:47,478 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:47,478 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 19 states have internal predecessors, (114), 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-09-08 03:03:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:47,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 03:03:47,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:50,031 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-09-08 03:03:53,054 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 [0] [2024-09-08 03:03:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:03:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:53,261 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-09-08 03:03:53,455 WARN L456 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-09-08 03:03:53,456 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:53,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 741122395, now seen corresponding path program 1 times [2024-09-08 03:03:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311409265] [2024-09-08 03:03:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:53,457 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-09-08 03:03:53,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:53,460 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-09-08 03:03:53,461 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-09-08 03:03:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:53,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-08 03:03:53,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:54,220 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 03:03:54,220 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 18 treesize of output 17 [2024-09-08 03:03:54,330 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 03:03:54,330 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 22 treesize of output 21 [2024-09-08 03:03:54,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 03:03:54,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 1 case distinctions, treesize of input 22 treesize of output 21 [2024-09-08 03:03:54,655 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 03:03:54,655 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 24 [2024-09-08 03:03:54,889 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 03:03:54,889 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 2 case distinctions, treesize of input 40 treesize of output 38 [2024-09-08 03:03:54,907 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 03:03:54,907 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 32 treesize of output 29 [2024-09-08 03:03:54,964 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-09-08 03:03:54,981 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-09-08 03:03:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:55,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:03:55,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-09-08 03:03:55,121 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-08 03:03:56,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:03:56,077 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 752 treesize of output 747 [2024-09-08 03:03:56,100 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 419 treesize of output 415 [2024-09-08 03:03:56,106 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 415 treesize of output 407 [2024-09-08 03:03:56,112 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 407 treesize of output 403 [2024-09-08 03:03:56,119 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 403 treesize of output 401 [2024-09-08 03:03:56,125 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 401 treesize of output 393 [2024-09-08 03:03:56,131 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 393 treesize of output 389 [2024-09-08 03:03:56,154 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 389 treesize of output 387 [2024-09-08 03:03:56,160 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 387 treesize of output 385 [2024-09-08 03:03:56,168 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 385 treesize of output 383 [2024-09-08 03:03:56,174 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 383 treesize of output 379 [2024-09-08 03:03:56,181 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 379 treesize of output 377 [2024-09-08 03:03:56,187 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 377 treesize of output 373 [2024-09-08 03:03:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:03:56,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:03:56,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311409265] [2024-09-08 03:03:56,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311409265] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:03:56,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:03:56,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-09-08 03:03:56,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905496347] [2024-09-08 03:03:56,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:03:56,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-08 03:03:56,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:03:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-08 03:03:56,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=771, Unknown=28, NotChecked=118, Total=1056 [2024-09-08 03:03:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:56,860 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:03:56,860 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 32 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-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:56,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:56,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:03:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:03:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:03:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:03:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 03:03:58,594 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 (32)] Forceful destruction successful, exit code 0 [2024-09-08 03:03:58,792 WARN L456 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-09-08 03:03:58,793 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:03:58,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:03:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -877004733, now seen corresponding path program 1 times [2024-09-08 03:03:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:03:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999107000] [2024-09-08 03:03:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:03:58,794 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-09-08 03:03:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:03:58,795 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09-08 03:03:58,797 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 (33)] Waiting until timeout for monitored process [2024-09-08 03:03:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:03:59,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-08 03:03:59,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:03:59,121 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 03:03:59,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 17 [2024-09-08 03:03:59,458 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 03:03:59,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 03:03:59,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:03:59,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:03:59,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 03:03:59,514 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 16 treesize of output 5 [2024-09-08 03:03:59,659 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 03:03:59,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 21 [2024-09-08 03:03:59,849 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2024-09-08 03:03:59,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 107 [2024-09-08 03:03:59,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-09-08 03:04:00,028 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-09-08 03:04:00,146 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-09-08 03:04:00,149 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-09-08 03:04:00,192 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-09-08 03:04:00,208 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 19 treesize of output 18 [2024-09-08 03:04:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:04:00,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:04:00,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 17 [2024-09-08 03:04:00,366 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#m~0.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) is different from false [2024-09-08 03:04:00,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#m~0.offset| (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1166)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) is different from false [2024-09-08 03:04:00,639 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-08 03:04:00,640 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2024-09-08 03:04:00,643 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 132 treesize of output 120 [2024-09-08 03:04:00,647 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 23 treesize of output 21 [2024-09-08 03:04:00,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:00,657 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 31 treesize of output 33 [2024-09-08 03:04:01,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:01,367 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 318 treesize of output 311 [2024-09-08 03:04:01,375 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 146 treesize of output 138 [2024-09-08 03:04:01,434 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 12 treesize of output 10 [2024-09-08 03:04:01,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:01,468 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 318 treesize of output 311 [2024-09-08 03:04:01,476 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 146 treesize of output 138 [2024-09-08 03:04:01,542 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 12 treesize of output 10 [2024-09-08 03:04:01,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:01,568 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 238 treesize of output 233 [2024-09-08 03:04:01,573 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 146 treesize of output 138 [2024-09-08 03:04:01,642 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 12 treesize of output 10 [2024-09-08 03:04:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 03:04:31,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:04:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999107000] [2024-09-08 03:04:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999107000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:04:31,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:04:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-09-08 03:04:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790089918] [2024-09-08 03:04:31,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:04:31,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 03:04:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:04:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 03:04:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=340, Unknown=17, NotChecked=78, Total=506 [2024-09-08 03:04:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:31,368 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:04:31,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:04:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:31,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 03:04:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:34,633 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 (33)] Ended with exit code 0 [2024-09-08 03:04:34,828 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-09-08 03:04:34,829 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:04:34,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:04:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1897379409, now seen corresponding path program 1 times [2024-09-08 03:04:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:04:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707672093] [2024-09-08 03:04:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:04:34,830 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-09-08 03:04:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:04:34,832 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-09-08 03:04:34,834 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-09-08 03:04:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:04:35,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 03:04:35,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:04:35,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 03:04:35,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-09-08 03:04:35,074 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-09-08 03:04:35,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:35,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-08 03:04:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 03:04:35,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:04:35,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:04:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707672093] [2024-09-08 03:04:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707672093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:04:35,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:04:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 03:04:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606215251] [2024-09-08 03:04:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:04:35,099 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 03:04:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:04:35,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 03:04:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 03:04:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:35,100 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:04:35,100 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-09-08 03:04:35,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:35,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:35,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:35,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:35,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:35,809 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-09-08 03:04:36,007 WARN L456 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-09-08 03:04:36,007 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:04:36,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:04:36,008 INFO L85 PathProgramCache]: Analyzing trace with hash -460996992, now seen corresponding path program 1 times [2024-09-08 03:04:36,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:04:36,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268252895] [2024-09-08 03:04:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:04:36,008 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-09-08 03:04:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:04:36,009 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-09-08 03:04:36,011 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-09-08 03:04:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:04:36,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 03:04:36,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:04:36,680 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 03:04:36,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-09-08 03:04:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:04:36,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:04:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:04:37,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:04:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268252895] [2024-09-08 03:04:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268252895] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:04:37,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:04:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-09-08 03:04:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46223477] [2024-09-08 03:04:37,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:04:37,076 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-08 03:04:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:04:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-08 03:04:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2024-09-08 03:04:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:37,077 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:04:37,077 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 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-09-08 03:04:37,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:37,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:37,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:37,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:37,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:37,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 03:04:39,180 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 (35)] Ended with exit code 0 [2024-09-08 03:04:39,373 WARN L456 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-09-08 03:04:39,374 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:04:39,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:04:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799301, now seen corresponding path program 1 times [2024-09-08 03:04:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:04:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920590616] [2024-09-08 03:04:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:04:39,374 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-09-08 03:04:39,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:04:39,376 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-09-08 03:04:39,378 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-09-08 03:04:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:04:39,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 03:04:39,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:04:39,833 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-09-08 03:04:39,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:39,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-09-08 03:04:39,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 03:04:39,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-08 03:04:39,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:39,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 03:04:39,891 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 03:04:39,891 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 23 treesize of output 20 [2024-09-08 03:04:39,918 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-09-08 03:04:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 03:04:39,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 03:04:39,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:04:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920590616] [2024-09-08 03:04:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920590616] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 03:04:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 03:04:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 03:04:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472495067] [2024-09-08 03:04:39,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 03:04:39,943 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 03:04:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:04:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 03:04:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-08 03:04:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:39,943 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:04:39,943 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:39,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:04:39,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:39,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 03:04:39,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:04:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:04:40,946 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-09-08 03:04:41,140 WARN L456 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-09-08 03:04:41,140 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:04:41,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:04:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1349471029, now seen corresponding path program 1 times [2024-09-08 03:04:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:04:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670180452] [2024-09-08 03:04:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 03:04:41,141 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-09-08 03:04:41,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:04:41,144 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-09-08 03:04:41,180 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-09-08 03:04:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 03:04:41,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-08 03:04:41,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:04:41,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-09-08 03:04:41,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 03:04:41,825 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 03:04:41,825 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 16 treesize of output 15 [2024-09-08 03:04:41,871 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:04:41,871 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-09-08 03:04:41,924 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 03:04:41,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 03:04:42,018 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 03:04:42,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2024-09-08 03:04:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2024-09-08 03:04:42,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 7 [2024-09-08 03:04:42,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:04:42,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:42,503 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 03:04:42,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 51 [2024-09-08 03:04:42,540 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-09-08 03:04:42,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 56 [2024-09-08 03:04:42,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2024-09-08 03:04:42,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-09-08 03:04:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 03:04:42,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:04:42,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_38) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (not .cse0))))) is different from false [2024-09-08 03:04:44,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 03:04:44,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:44,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-09-08 03:04:44,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2024-09-08 03:04:44,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:44,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2024-09-08 03:04:44,282 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 204 treesize of output 196 [2024-09-08 03:04:44,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:04:44,291 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 71 treesize of output 75 [2024-09-08 03:04:44,295 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 24 treesize of output 22 [2024-09-08 03:04:44,693 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 10 treesize of output 8 [2024-09-08 03:04:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 03:04:44,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:04:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670180452] [2024-09-08 03:04:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670180452] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:04:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:04:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-09-08 03:04:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677996457] [2024-09-08 03:04:44,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:04:44,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-08 03:04:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:04:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-08 03:04:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=687, Unknown=28, NotChecked=54, Total=870 [2024-09-08 03:04:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:44,911 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:04:44,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.866666666666666) internal successors, (146), 29 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:44,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:04:44,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:04:50,910 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 [0] [2024-09-08 03:04:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:04:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:04:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:04:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 03:04:51,756 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-09-08 03:04:51,954 WARN L456 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-09-08 03:04:51,954 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:04:51,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:04:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 116354577, now seen corresponding path program 2 times [2024-09-08 03:04:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:04:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337889664] [2024-09-08 03:04:51,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 03:04:51,955 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-09-08 03:04:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:04:51,958 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-09-08 03:04:51,959 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-09-08 03:04:52,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 03:04:52,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 03:04:52,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-08 03:04:52,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:04:52,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-09-08 03:04:52,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 03:04:52,528 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-09-08 03:04:52,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-09-08 03:04:52,606 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-09-08 03:04:52,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 03:04:52,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-09-08 03:04:52,691 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-09-08 03:04:52,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 51 [2024-09-08 03:04:52,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:52,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09-08 03:04:52,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-08 03:04:52,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-09-08 03:04:52,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:04:52,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-09-08 03:04:52,914 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-09-08 03:04:52,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 26 [2024-09-08 03:04:53,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-09-08 03:04:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 03:04:53,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:04:53,300 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) is different from false [2024-09-08 03:04:53,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse5 |c_~#top~0.offset|)))) (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse1 (not .cse6))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse3 (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3))) (or (= (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)))))))) (or .cse6 (forall ((v_DerPreprocessor_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store (store .cse7 |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))))) (or (not .cse0) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))) .cse6) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_53)))) (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53))))) .cse1))))))) is different from false [2024-09-08 03:05:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 03:05:11,482 INFO L349 Elim1Store]: treesize reduction 49, result has 40.2 percent of original size [2024-09-08 03:05:11,483 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 21470 treesize of output 18804 [2024-09-08 03:05:11,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:05:11,542 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 179 [2024-09-08 03:05:11,560 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 173 treesize of output 169 [2024-09-08 03:05:11,573 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-09-08 03:05:11,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 1 [2024-09-08 03:05:11,710 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-08 03:05:11,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2024-09-08 03:05:11,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:05:11,753 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 39 treesize of output 43 [2024-09-08 03:05:11,783 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 142 [2024-09-08 03:05:11,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 03:05:11,950 INFO L349 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2024-09-08 03:05:11,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 10927 treesize of output 10522 [2024-09-08 03:05:12,016 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 03:05:12,017 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 876 treesize of output 858 [2024-09-08 03:05:12,050 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 690 treesize of output 668 [2024-09-08 03:05:12,097 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-09-08 03:05:12,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 355 treesize of output 339 [2024-09-08 03:05:12,187 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 90 treesize of output 86 [2024-09-08 03:05:12,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 86 treesize of output 78 [2024-09-08 03:05:12,488 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 10 treesize of output 8 [2024-09-08 03:05:14,976 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 10 treesize of output 8 [2024-09-08 03:05:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 1 times theorem prover too weak. 3 trivial. 2 not checked. [2024-09-08 03:05:17,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:05:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337889664] [2024-09-08 03:05:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337889664] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:05:17,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:05:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-09-08 03:05:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687238032] [2024-09-08 03:05:17,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:05:17,112 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-08 03:05:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:05:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-08 03:05:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=551, Unknown=52, NotChecked=102, Total=812 [2024-09-08 03:05:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:05:17,113 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:05:17,113 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:05:17,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:05:17,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:05:17,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:05:17,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:05:17,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 03:05:17,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:05:20,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:05:29,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:05:35,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:05:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:00,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:16,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:21,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:26,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:30,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:43,161 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-09-08 03:06:45,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:06:57,057 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse14 |c_~#top~0.offset|))) (.cse16 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse0 (not .cse16)) (.cse15 (not .cse1))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (= (_ bv3 32) |c_~#m~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32))) (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse7 (store .cse3 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse4 (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse6 (store .cse7 |c_~#top~0.base| .cse4))) (let ((.cse5 (store (select .cse6 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse6 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse3 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse4) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse5) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32)) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse13 (store .cse10 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse8 (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse12 (store .cse13 |c_~#top~0.base| .cse8))) (let ((.cse9 (store (select .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse11 (store .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse9))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse8) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse9) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse10 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse15))) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or .cse16 (and (or .cse1 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32))) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse20 (let ((.cse21 (store .cse18 |c_~#m~0.base| v_ArrVal_1566))) (store .cse21 |c_~#top~0.base| (store (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse19 (store (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse17 (store .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse19))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (not (= (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse18 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse19) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse17 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32)) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse26 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse26))) (let ((.cse25 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse26) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse24 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse22 (store (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse23 (store .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse22))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse22) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse23 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse24 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse15))) (or .cse16 (and (or .cse1 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse30 (let ((.cse31 (store .cse29 |c_~#m~0.base| v_ArrVal_1566))) (store .cse31 |c_~#top~0.base| (store (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse27 (store (select .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse28 (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse28 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse29 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse36 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse34 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse36))) (let ((.cse35 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse36) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse34 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse33 (store (select .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse33))) (or (not (= v_DerPreprocessor_54 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse33) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse34 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse15))) (= (_ bv0 32) |c_~#m~0.offset|) (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse42 (store .cse38 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse39 (store (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse41 (store .cse42 |c_~#top~0.base| .cse39))) (let ((.cse40 (store (select .cse41 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse37 (store .cse41 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse40))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse38 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse37 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse40) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse46 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse48 (store .cse46 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse44 (store (select .cse48 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse47 (store .cse48 |c_~#top~0.base| .cse44))) (let ((.cse45 (store (select .cse47 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse43 (store .cse47 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse45))) (or (= (_ bv1 32) (select (select .cse43 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse44) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse45) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse46 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse15))))))) is different from true [2024-09-08 03:07:08,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:21,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:25,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:27,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:29,409 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-09-08 03:07:36,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:38,506 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse17 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse17 |c_~#top~0.offset|))) (.cse3 (not .cse2)) (.cse18 (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (let ((.cse1 (= (_ bv1 32) .cse18)) (.cse5 (or .cse3 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse37 |c_~#top~0.base| (store (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))))) (.cse4 (not .cse0)) (.cse6 (or .cse2 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse34 (store .cse31 |c_~#top~0.base| (store (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse32 (store (select .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse33 (store .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32))) (or (= (_ bv1 32) (select (select (store (store (store .cse31 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse33 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse4) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and .cse5 .cse6) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse5 (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|) (or .cse2 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse10 (let ((.cse11 (store .cse9 |c_~#m~0.base| v_ArrVal_1566))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse9 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse14 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16))) (let ((.cse15 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse14 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse13 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13))) (or (not (= v_DerPreprocessor_54 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse14 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse4))) (= |c_thr1Thread2of3ForFork0_push_#t~mem13#1| .cse18) (or .cse3 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse24 (store .cse20 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse21 (store (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse23 (store .cse24 |c_~#top~0.base| .cse21))) (let ((.cse22 (store (select .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22))) (or (not (= (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse20 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse21) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse30 (store .cse28 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse26 (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse29 (store .cse30 |c_~#top~0.base| .cse26))) (let ((.cse27 (store (select .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse25 (store .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27))) (or (= (_ bv1 32) (select (select .cse25 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse26) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse28 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse4))) .cse6)))) is different from true [2024-09-08 03:07:40,826 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse17 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse17 |c_~#top~0.offset|))) (.cse18 (not .cse6))) (let ((.cse1 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse2 (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse6) (or .cse18 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) (.cse4 (or .cse18 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse37 |c_~#top~0.base| (store (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))))) (.cse3 (not .cse0)) (.cse5 (or .cse6 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse34 (store .cse31 |c_~#top~0.base| (store (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse32 (store (select .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse33 (store .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32))) (or (= (_ bv1 32) (select (select (store (store (store .cse31 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse33 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or .cse2 .cse3) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (or .cse2 (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and .cse4 .cse5) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse4 (or .cse6 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse10 (let ((.cse11 (store .cse9 |c_~#m~0.base| v_ArrVal_1566))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse9 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse14 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16))) (let ((.cse15 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse14 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse13 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13))) (or (not (= v_DerPreprocessor_54 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse14 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse3))) (or .cse18 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse24 (store .cse20 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse21 (store (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse23 (store .cse24 |c_~#top~0.base| .cse21))) (let ((.cse22 (store (select .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22))) (or (not (= (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse20 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse21) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse30 (store .cse28 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse26 (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse29 (store .cse30 |c_~#top~0.base| .cse26))) (let ((.cse27 (store (select .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse25 (store .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27))) (or (= (_ bv1 32) (select (select .cse25 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse26) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse28 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse3))) .cse5)))) is different from true [2024-09-08 03:07:42,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:43,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:45,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:51,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:53,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:07:57,968 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 [0, 1] [2024-09-08 03:08:00,004 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse16 |c_~#top~0.offset|))) (.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (not .cse0)) (.cse17 (not .cse5))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv3 32) |c_~#m~0.base|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or .cse1 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) (or (and (= (_ bv1 32) (select (select |c_#memory_int| (_ bv4 32)) (_ bv0 32))) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (exists ((v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46) (_ bv4 32) v_DerPreprocessor_47) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32) (_ bv1 32)) (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or .cse1 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))) (or .cse0 (and (or .cse5 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse9 (let ((.cse10 (store .cse8 |c_~#m~0.base| v_ArrVal_1566))) (store .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse6 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse6))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse6) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse8 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse15 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse13 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15))) (let ((.cse14 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse13 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse12 (store (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse11 (store .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12))) (or (not (= v_DerPreprocessor_54 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse17))) (= (_ bv0 32) |c_~#m~0.offset|) (or .cse1 (and (or .cse5 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse23 (store .cse19 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse20 (store (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse22 (store .cse23 |c_~#top~0.base| .cse20))) (let ((.cse21 (store (select .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21))) (or (not (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse18 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse20) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse29 (store .cse27 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse28 (store .cse29 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (= (_ bv1 32) (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse25) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse17))) (or .cse0 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse33 (store .cse30 |c_~#top~0.base| (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select (store (store (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))) is different from true [2024-09-08 03:08:04,786 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse16 |c_~#top~0.offset|))) (.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (not .cse0)) (.cse17 (not .cse5))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv3 32) |c_~#m~0.base|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or .cse1 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) (or (and (= (_ bv1 32) (select (select |c_#memory_int| (_ bv4 32)) (_ bv0 32))) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (exists ((v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46) (_ bv4 32) v_DerPreprocessor_47) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32) (_ bv1 32)) (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or .cse1 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))) (or .cse0 (and (or .cse5 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse9 (let ((.cse10 (store .cse8 |c_~#m~0.base| v_ArrVal_1566))) (store .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse6 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse6))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse6) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse8 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse15 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse13 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15))) (let ((.cse14 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse13 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse12 (store (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse11 (store .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12))) (or (not (= v_DerPreprocessor_54 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse17))) (= (_ bv0 32) |c_~#m~0.offset|) (or .cse1 (and (or .cse5 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse23 (store .cse19 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse20 (store (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse22 (store .cse23 |c_~#top~0.base| .cse20))) (let ((.cse21 (store (select .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21))) (or (not (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse18 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse20) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse29 (store .cse27 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse28 (store .cse29 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (= (_ bv1 32) (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse25) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse17))) (or .cse0 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse33 (store .cse30 |c_~#top~0.base| (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select (store (store (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))) is different from true [2024-09-08 03:08:06,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:08:10,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:08:15,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:08:16,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 03:08:20,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:08:21,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:08:24,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:08:28,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:08:29,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:08:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:08:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:08:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-08 03:08:30,225 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 (38)] Forceful destruction successful, exit code 0 [2024-09-08 03:08:30,419 WARN L456 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-09-08 03:08:30,420 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 03:08:30,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 03:08:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1422240575, now seen corresponding path program 2 times [2024-09-08 03:08:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 03:08:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844123107] [2024-09-08 03:08:30,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 03:08:30,420 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-09-08 03:08:30,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 03:08:30,421 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-09-08 03:08:30,423 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-09-08 03:08:30,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 03:08:30,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 03:08:30,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 03:08:30,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 03:08:32,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2024-09-08 03:08:32,460 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-09-08 03:08:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 45 [2024-09-08 03:08:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-08 03:08:33,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 03:08:37,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (and (or (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m~0.base|) |c_~#m~0.offset|)))) (forall ((v_DerPreprocessor_61 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_61)))) (store .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= (_ bv0 32) .cse0) (= (_ bv1 32) .cse0)))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_60)))) (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= (_ bv1 32) .cse3) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= (_ bv0 32) .cse3)))) (forall ((v_DerPreprocessor_62 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_62)))) (store .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= .cse5 (_ bv0 32)) (= .cse5 (_ bv1 32))))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (= (select (select |c_#memory_int| |c_~#m2~0.base|) |c_~#m2~0.offset|) (_ bv0 32))) (forall ((v_DerPreprocessor_63 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_63)))) (store .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= .cse7 (_ bv1 32)) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= .cse7 (_ bv0 32)))))) (not .cse9)) (or .cse9 (and (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse10 (_ bv0 32)) (= .cse10 (_ bv1 32))))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))) (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= (_ bv1 32) .cse11) (= (_ bv0 32) .cse11)))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) is different from false [2024-09-08 03:08:37,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 03:08:37,701 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 890 treesize of output 813 [2024-09-08 03:08:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2024-09-08 03:08:38,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 03:08:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844123107] [2024-09-08 03:08:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844123107] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 03:08:38,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 03:08:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-09-08 03:08:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830994456] [2024-09-08 03:08:38,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 03:08:38,364 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 03:08:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 03:08:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 03:08:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=91, Unknown=5, NotChecked=20, Total=156 [2024-09-08 03:08:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:08:38,365 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 03:08:38,365 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 03:08:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-09-08 03:08:38,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 03:08:51,729 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 [0] [2024-09-08 03:08:58,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:04,172 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-09-08 03:09:17,942 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-09-08 03:09:20,181 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-09-08 03:09:22,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (not .cse5))) (let ((.cse0 (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse5) (or .cse1 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv3 32) |c_~#m~0.base|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (or .cse0 (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) (or (and (or .cse1 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))) (or .cse5 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse9 (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse7 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) (or (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) .cse0) (= (_ bv0 32) |c_~#m~0.offset|))))) is different from false [2024-09-08 03:09:24,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:26,309 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-09-08 03:09:30,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:36,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:45,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:47,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:09:57,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:20,092 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 [0] [2024-09-08 03:10:23,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:25,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:27,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:29,561 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-09-08 03:10:32,514 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-09-08 03:10:37,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:50,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 03:10:51,086 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse8 |c_~#top~0.offset|)))) (let ((.cse9 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) (.cse11 (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (.cse12 (not .cse3)) (.cse0 (not (= (_ bv0 32) (bvadd (_ bv1 32) c_~next_alloc_idx~0)))) (.cse2 (not (= (_ bv0 1) (select |c_#valid| |c_~#top~0.base|)))) (.cse1 (not (= (_ bv0 32) |c_~#top~0.offset|)))) (and (or .cse0 .cse1) (or .cse2 .cse1 (not (= (_ bv0 32) (bvadd (_ bv1 32) |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (or .cse3 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= (_ bv1 32) (select (select (store (let ((.cse6 (store .cse4 |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse5 (store (select (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse5) |c_~#top~0.base| (store (select (store (store .cse6 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse5) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))))) (or (not (= (_ bv0 32) (bvadd (_ bv3 32) c_~next_alloc_idx~0))) .cse1) (not (= (_ bv0 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse7 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))) .cse9) (or .cse2 (and (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_42))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse10 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse10 |c_~#top~0.base|) (_ bv0 32)))))))) .cse12) (or .cse3 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse13 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (select (select .cse13 |c_~#top~0.base|) (_ bv0 32)) (_ bv1 32)))))))))) (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (store .cse14 |c_~#top~0.base| (store (store (select .cse14 |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32)))) .cse2 (not (= (_ bv0 32) (bvadd (select .cse8 (_ bv0 32)) (_ bv1 32))))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse15 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (not .cse9)) (or (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse18 (store .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45))) (or (= (_ bv1 32) (select (select (store (let ((.cse17 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse16 (store (select (store .cse17 |c_~#top~0.base| (store (select (store .cse18 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse16) |c_~#top~0.base| (store (select (store (store .cse17 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse16) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|)))) .cse12) (or .cse0 .cse2 .cse1) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32))) (or (not (= (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse19 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse20 (store (select (store .cse19 |c_~#top~0.base| (store (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store .cse19 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse20) |c_~#top~0.base| (store (select (store (store .cse19 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse20) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32)) (_ bv1 32))))))))) is different from false [2024-09-08 03:10:56,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c_~#top~0.offset|)))) (and (or (not (= (_ bv0 32) (bvadd (_ bv1 32) c_~next_alloc_idx~0))) .cse0) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (or (not (= (_ bv0 32) (bvadd (_ bv3 32) c_~next_alloc_idx~0))) .cse0) (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|))) is different from false [2024-09-08 03:10:58,668 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-09-08 03:11:00,076 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c_~#top~0.offset|)))) (and (or (not (= (_ bv0 32) (bvadd (_ bv1 32) c_~next_alloc_idx~0))) .cse0) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (or (not (= (_ bv0 32) (bvadd (_ bv3 32) c_~next_alloc_idx~0))) .cse0))) is different from false [2024-09-08 03:11:34,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse6 |c_~#top~0.offset|)))) (let ((.cse0 (not (= (_ bv0 1) (select |c_#valid| |c_~#top~0.base|)))) (.cse7 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) (.cse9 (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (.cse10 (not .cse1))) (and (or .cse0 (not (= (_ bv0 32) |c_~#top~0.offset|)) (not (= (_ bv0 32) (bvadd (_ bv1 32) |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (or .cse1 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= (_ bv1 32) (select (select (store (let ((.cse4 (store .cse2 |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse3 (store (select (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse3) |c_~#top~0.base| (store (select (store (store .cse4 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse3) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))))) (not (= (_ bv0 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse5 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))) .cse7) (or .cse0 (and (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_42))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse8 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse8 |c_~#top~0.base|) (_ bv0 32)))))))) .cse10) (or .cse1 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse11 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (select (select .cse11 |c_~#top~0.base|) (_ bv0 32)) (_ bv1 32)))))))))) (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (store .cse12 |c_~#top~0.base| (store (store (select .cse12 |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32)))) .cse0 (not (= (_ bv0 32) (bvadd (select .cse6 (_ bv0 32)) (_ bv1 32))))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse13 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (not .cse7)) (or (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse16 (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45))) (or (= (_ bv1 32) (select (select (store (let ((.cse15 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse14 (store (select (store .cse15 |c_~#top~0.base| (store (select (store .cse16 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse14) |c_~#top~0.base| (store (select (store (store .cse15 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse14) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse16 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|)))) .cse10) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32))) (or (not (= (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse18 (store (select (store .cse17 |c_~#top~0.base| (store (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store .cse17 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse18) |c_~#top~0.base| (store (select (store (store .cse17 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse18) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32)) (_ bv1 32))))))))) is different from false [2024-09-08 03:11:35,955 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|)) is different from false Killed by 15