./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7bc0c755 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/37_stack_lock_p0_vs_concur-pthread.i ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-validation-atomicfix-7bc0c75-m [2024-08-23 16:59:53,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-23 16:59:53,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-23 16:59:53,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-23 16:59:53,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-23 16:59:53,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-23 16:59:53,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-23 16:59:53,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-23 16:59:53,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-23 16:59:53,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-23 16:59:53,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-23 16:59:53,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-23 16:59:53,735 INFO L153 SettingsManager]: * Use SBE=true [2024-08-23 16:59:53,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-23 16:59:53,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-23 16:59:53,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-23 16:59:53,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-23 16:59:53,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-23 16:59:53,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-23 16:59:53,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-23 16:59:53,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-23 16:59:53,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-23 16:59:53,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-23 16:59:53,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-23 16:59:53,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-23 16:59:53,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-23 16:59:53,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-23 16:59:53,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-23 16:59:53,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-23 16:59:53,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-23 16:59:53,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 16:59:53,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-23 16:59:53,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-23 16:59:53,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-23 16:59:53,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-23 16:59:53,745 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-23 16:59:53,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-23 16:59:53,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-23 16:59:53,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-23 16:59:53,747 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-23 16:59:53,747 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-23 16:59:53,747 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-23 16:59:53,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-23 16:59:54,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-23 16:59:54,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-23 16:59:54,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-23 16:59:54,033 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-23 16:59:54,034 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-23 16:59:54,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-08-23 16:59:54,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-23 16:59:54,108 INFO L274 PluginConnector]: CDTParser initialized [2024-08-23 16:59:54,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-23 16:59:55,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-23 16:59:55,807 INFO L384 CDTParser]: Found 1 translation units. [2024-08-23 16:59:55,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-23 16:59:55,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fd4d29f8a/70d3f15440fd483b93054a53a88d093a/FLAGb819127b1 [2024-08-23 16:59:55,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fd4d29f8a/70d3f15440fd483b93054a53a88d093a [2024-08-23 16:59:55,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-23 16:59:55,831 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-23 16:59:55,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-23 16:59:55,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-23 16:59:55,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-23 16:59:55,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:59:54" (1/2) ... [2024-08-23 16:59:55,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292bb6b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:59:55, skipping insertion in model container [2024-08-23 16:59:55,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:59:54" (1/2) ... [2024-08-23 16:59:55,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73470810 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.08 04:59:55, skipping insertion in model container [2024-08-23 16:59:55,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 04:59:55" (2/2) ... [2024-08-23 16:59:55,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292bb6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:55, skipping insertion in model container [2024-08-23 16:59:55,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 04:59:55" (2/2) ... [2024-08-23 16:59:55,842 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-23 16:59:55,870 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-23 16:59:55,874 INFO L97 edCorrectnessWitness]: Location invariant before [L706-L706] (0 <= top) && (top <= 64) [2024-08-23 16:59:55,874 INFO L97 edCorrectnessWitness]: Location invariant before [L713-L713] (0 <= top) && (top <= 64) [2024-08-23 16:59:55,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-23 16:59:56,207 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-08-23 16:59:56,215 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 16:59:56,227 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-23 16:59:56,306 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] Start Parsing Local [2024-08-23 16:59:56,312 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-23 16:59:56,342 INFO L206 MainTranslator]: Completed translation [2024-08-23 16:59:56,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56 WrapperNode [2024-08-23 16:59:56,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-23 16:59:56,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-23 16:59:56,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-23 16:59:56,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-23 16:59:56,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,385 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2024-08-23 16:59:56,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-23 16:59:56,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-23 16:59:56,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-23 16:59:56,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-23 16:59:56,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-23 16:59:56,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-23 16:59:56,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-23 16:59:56,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-23 16:59:56,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (1/1) ... [2024-08-23 16:59:56,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-23 16:59:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 16:59:56,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-23 16:59:56,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-23 16:59:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-23 16:59:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-23 16:59:56,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-23 16:59:56,487 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-23 16:59:56,598 INFO L243 CfgBuilder]: Building ICFG [2024-08-23 16:59:56,600 INFO L269 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-23 16:59:56,755 INFO L288 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-23 16:59:56,755 INFO L292 CfgBuilder]: Performing block encoding [2024-08-23 16:59:56,898 INFO L314 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-23 16:59:56,898 INFO L319 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-23 16:59:56,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 04:59:56 BoogieIcfgContainer [2024-08-23 16:59:56,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-23 16:59:56,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-23 16:59:56,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-23 16:59:56,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-23 16:59:56,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.08 04:59:54" (1/4) ... [2024-08-23 16:59:56,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec894bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.08 04:59:56, skipping insertion in model container [2024-08-23 16:59:56,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 04:59:55" (2/4) ... [2024-08-23 16:59:56,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec894bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 04:59:56, skipping insertion in model container [2024-08-23 16:59:56,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 04:59:56" (3/4) ... [2024-08-23 16:59:56,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec894bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 04:59:56, skipping insertion in model container [2024-08-23 16:59:56,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 04:59:56" (4/4) ... [2024-08-23 16:59:56,919 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-08-23 16:59:56,939 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-23 16:59:56,940 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-08-23 16:59:56,940 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-23 16:59:56,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 16:59:57,042 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 16:59:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 16:59:57,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 16:59:57,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-23 16:59:57,093 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 16:59:57,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-23 16:59:57,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:57,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-23 16:59:57,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 16:59:57,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 150307150, now seen corresponding path program 1 times [2024-08-23 16:59:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668514044] [2024-08-23 16:59:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668514044] [2024-08-23 16:59:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668514044] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-23 16:59:57,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955581720] [2024-08-23 16:59:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:57,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 16:59:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:57,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 16:59:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 16:59:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:57,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:57,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:57,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-23 16:59:57,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 16:59:57,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -528617194, now seen corresponding path program 1 times [2024-08-23 16:59:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77064067] [2024-08-23 16:59:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77064067] [2024-08-23 16:59:58,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77064067] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:58,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:58,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-23 16:59:58,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366102600] [2024-08-23 16:59:58,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:58,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 16:59:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 16:59:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-23 16:59:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:58,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:58,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:58,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-23 16:59:58,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 16:59:58,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash 306972498, now seen corresponding path program 1 times [2024-08-23 16:59:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662724742] [2024-08-23 16:59:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662724742] [2024-08-23 16:59:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662724742] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:58,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-23 16:59:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570074493] [2024-08-23 16:59:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:58,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-23 16:59:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:58,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-23 16:59:58,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-23 16:59:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,514 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:58,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:58,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-23 16:59:58,640 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-23 16:59:58,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-23 16:59:58,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-23 16:59:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-23 16:59:58,650 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-23 16:59:58,652 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE (1/2) [2024-08-23 16:59:58,656 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:58,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 16:59:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 16:59:58,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 16:59:58,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-08-23 16:59:58,681 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 16:59:58,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-23 16:59:58,683 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:58,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-23 16:59:58,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:58,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1583709203, now seen corresponding path program 1 times [2024-08-23 16:59:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524288275] [2024-08-23 16:59:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524288275] [2024-08-23 16:59:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524288275] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:58,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 16:59:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21048679] [2024-08-23 16:59:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 16:59:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:58,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 16:59:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 16:59:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:58,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:58,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-23 16:59:58,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:58,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1194974795, now seen corresponding path program 1 times [2024-08-23 16:59:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589052063] [2024-08-23 16:59:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:58,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589052063] [2024-08-23 16:59:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589052063] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 16:59:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311704768] [2024-08-23 16:59:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:58,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 16:59:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 16:59:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-23 16:59:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:58,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.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-08-23 16:59:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:59,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-23 16:59:59,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:59,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1542646995, now seen corresponding path program 1 times [2024-08-23 16:59:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492958183] [2024-08-23 16:59:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492958183] [2024-08-23 16:59:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492958183] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:59,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-23 16:59:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858253326] [2024-08-23 16:59:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:59,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-23 16:59:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-23 16:59:59,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-23 16:59:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:59,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:59,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:59,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:59,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:59,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 16:59:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-23 16:59:59,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-23 16:59:59,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:59,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1610541106, now seen corresponding path program 1 times [2024-08-23 16:59:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549986367] [2024-08-23 16:59:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 16:59:59,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-23 16:59:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 16:59:59,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-23 16:59:59,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-23 16:59:59,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-23 16:59:59,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-23 16:59:59,377 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-23 16:59:59,377 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-23 16:59:59,379 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-23 16:59:59,379 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-23 16:59:59,408 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 16:59:59,412 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 16:59:59,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 16:59:59,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 16:59:59,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-08-23 16:59:59,420 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 16:59:59,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-23 16:59:59,421 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 16:59:59,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-23 16:59:59,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:59,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1122837360, now seen corresponding path program 1 times [2024-08-23 16:59:59,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965722281] [2024-08-23 16:59:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 16:59:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965722281] [2024-08-23 16:59:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965722281] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 16:59:59,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 16:59:59,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 16:59:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449577789] [2024-08-23 16:59:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 16:59:59,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 16:59:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 16:59:59,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 16:59:59,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 16:59:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:59,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 16:59:59,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 16:59:59,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 16:59:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 16:59:59,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-23 16:59:59,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 16:59:59,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 16:59:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash -889200088, now seen corresponding path program 1 times [2024-08-23 16:59:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 16:59:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275960041] [2024-08-23 16:59:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 16:59:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 16:59:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 16:59:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275960041] [2024-08-23 16:59:59,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275960041] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 16:59:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411953144] [2024-08-23 16:59:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 16:59:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 16:59:59,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 16:59:59,861 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-08-23 16:59:59,863 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-08-23 16:59:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 16:59:59,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-23 16:59:59,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:00,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:00,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:00:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411953144] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:00:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-23 17:00:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731605880] [2024-08-23 17:00:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:00,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:00:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:00:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-23 17:00:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:00,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:00,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-23 17:00:00,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:00,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:00:00,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 642535261, now seen corresponding path program 1 times [2024-08-23 17:00:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:00,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255725960] [2024-08-23 17:00:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 17:00:00,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:00,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255725960] [2024-08-23 17:00:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255725960] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:00,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 17:00:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 17:00:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933704193] [2024-08-23 17:00:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 17:00:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 17:00:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-23 17:00:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:00,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 17:00:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-23 17:00:00,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:00:00,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -466935943, now seen corresponding path program 1 times [2024-08-23 17:00:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004725964] [2024-08-23 17:00:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 17:00:00,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-23 17:00:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 17:00:00,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-23 17:00:00,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-23 17:00:00,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-23 17:00:00,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-23 17:00:00,590 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-23 17:00:00,591 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-23 17:00:00,591 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-23 17:00:00,591 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-23 17:00:00,625 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 17:00:00,630 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:00:00,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 17:00:00,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:00,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 17:00:00,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-23 17:00:00,636 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 17:00:00,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-23 17:00:00,638 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:00:00,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-23 17:00:00,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:00,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1844731757, now seen corresponding path program 1 times [2024-08-23 17:00:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172284600] [2024-08-23 17:00:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:00,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172284600] [2024-08-23 17:00:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172284600] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:00,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 17:00:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 17:00:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285728102] [2024-08-23 17:00:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:00:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:00:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 17:00:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:00,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:00,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:00,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-23 17:00:00,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:00,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1608911659, now seen corresponding path program 1 times [2024-08-23 17:00:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143601559] [2024-08-23 17:00:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143601559] [2024-08-23 17:00:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143601559] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096793647] [2024-08-23 17:00:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:01,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:01,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:01,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-08-23 17:00:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:01,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-23 17:00:01,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:01,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:01,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:00:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096793647] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:01,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:00:01,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-23 17:00:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467673671] [2024-08-23 17:00:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:01,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:00:01,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:00:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-23 17:00:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:01,340 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:01,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:01,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:01,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:02,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-23 17:00:02,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-23 17:00:02,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:02,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1157482927, now seen corresponding path program 1 times [2024-08-23 17:00:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267135411] [2024-08-23 17:00:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267135411] [2024-08-23 17:00:02,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267135411] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600976300] [2024-08-23 17:00:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:02,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:02,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:02,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-23 17:00:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:02,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-23 17:00:02,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:02,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:02,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:02,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:02,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:02,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:00:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600976300] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:02,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-23 17:00:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019948010] [2024-08-23 17:00:02,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:02,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-23 17:00:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-23 17:00:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-23 17:00:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:02,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:02,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:02,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:02,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:02,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:03,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-23 17:00:03,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-23 17:00:03,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:03,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1334266025, now seen corresponding path program 1 times [2024-08-23 17:00:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211215782] [2024-08-23 17:00:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211215782] [2024-08-23 17:00:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211215782] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121416375] [2024-08-23 17:00:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:04,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-23 17:00:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:04,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-23 17:00:04,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:04,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:04,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:04,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:04,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:04,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:04,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:00:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121416375] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:04,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-23 17:00:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652786943] [2024-08-23 17:00:04,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:04,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-23 17:00:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-23 17:00:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-23 17:00:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:04,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-23 17:00:05,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-23 17:00:05,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:05,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:05,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash -40978486, now seen corresponding path program 1 times [2024-08-23 17:00:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019436324] [2024-08-23 17:00:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019436324] [2024-08-23 17:00:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019436324] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430295579] [2024-08-23 17:00:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:05,884 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:05,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-23 17:00:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:06,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-23 17:00:06,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:06,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:06,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:06,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:06,176 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-23 17:00:06,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:06,185 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-23 17:00:06,212 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 37 treesize of output 23 [2024-08-23 17:00:06,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:00:06,223 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 20 treesize of output 12 [2024-08-23 17:00:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430295579] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:06,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-23 17:00:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941234218] [2024-08-23 17:00:06,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:06,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-23 17:00:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:06,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-23 17:00:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-23 17:00:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:06,252 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-08-23 17:00:06,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:06,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:06,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:06,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-23 17:00:06,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:06,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-23 17:00:06,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-08-23 17:00:06,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:06,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2063358310, now seen corresponding path program 1 times [2024-08-23 17:00:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301126551] [2024-08-23 17:00:06,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301126551] [2024-08-23 17:00:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301126551] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743579544] [2024-08-23 17:00:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:07,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:07,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:07,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:07,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-08-23 17:00:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:07,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-23 17:00:07,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:07,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:07,456 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-08-23 17:00:07,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:07,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:00:07,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:00:07,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:00:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:07,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:07,688 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-23 17:00:07,858 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-08-23 17:00:07,867 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-08-23 17:00:08,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:08,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:00:08,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:08,252 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 20 treesize of output 21 [2024-08-23 17:00:08,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:00:08,256 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 18 treesize of output 10 [2024-08-23 17:00:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743579544] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:08,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-08-23 17:00:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194740468] [2024-08-23 17:00:08,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:08,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-23 17:00:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-23 17:00:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=380, Unknown=2, NotChecked=40, Total=506 [2024-08-23 17:00:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:08,307 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:08,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 22 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:08,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:08,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:08,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:08,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:08,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:08,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-23 17:00:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-08-23 17:00:10,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-08-23 17:00:10,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:10,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1319353030, now seen corresponding path program 2 times [2024-08-23 17:00:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179770879] [2024-08-23 17:00:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:11,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179770879] [2024-08-23 17:00:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179770879] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550636532] [2024-08-23 17:00:11,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:00:11,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:11,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:11,086 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-08-23 17:00:11,088 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-08-23 17:00:11,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-23 17:00:11,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:11,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-23 17:00:11,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:11,277 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 16 treesize of output 8 [2024-08-23 17:00:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-23 17:00:11,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:00:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550636532] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:11,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:00:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-23 17:00:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724819576] [2024-08-23 17:00:11,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:11,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-23 17:00:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-23 17:00:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-08-23 17:00:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:11,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:11,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-23 17:00:11,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:12,133 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-08-23 17:00:12,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-23 17:00:12,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:12,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2033089872, now seen corresponding path program 3 times [2024-08-23 17:00:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265315157] [2024-08-23 17:00:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265315157] [2024-08-23 17:00:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265315157] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492516565] [2024-08-23 17:00:12,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-23 17:00:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:12,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:12,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-23 17:00:12,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-23 17:00:12,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:12,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-23 17:00:12,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:12,791 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 13 treesize of output 9 [2024-08-23 17:00:12,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:12,877 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-23 17:00:12,878 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 60 treesize of output 88 [2024-08-23 17:00:12,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:00:12,957 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-23 17:00:12,957 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 31 treesize of output 36 [2024-08-23 17:00:12,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:00:12,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:12,986 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-08-23 17:00:13,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:13,979 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 193 treesize of output 141 [2024-08-23 17:00:14,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:14,000 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 82 treesize of output 87 [2024-08-23 17:00:14,007 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 78 treesize of output 76 [2024-08-23 17:00:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-23 17:00:14,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:00:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492516565] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:00:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2024-08-23 17:00:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486212423] [2024-08-23 17:00:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:14,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-23 17:00:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-23 17:00:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-08-23 17:00:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:14,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:14,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:14,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:14,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:14,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:15,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-23 17:00:15,794 WARN L477 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-08-23 17:00:15,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:15,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1747557515, now seen corresponding path program 1 times [2024-08-23 17:00:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122923751] [2024-08-23 17:00:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:16,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122923751] [2024-08-23 17:00:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122923751] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:16,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251253654] [2024-08-23 17:00:16,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:16,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:16,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-23 17:00:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:16,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-23 17:00:16,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:16,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:16,261 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-08-23 17:00:16,293 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:00:16,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:00:16,299 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-08-23 17:00:16,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:00:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:16,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:16,415 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-23 17:00:16,460 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-23 17:00:16,692 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-08-23 17:00:16,703 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-08-23 17:00:16,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-23 17:00:16,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:16,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:00:16,953 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 86 treesize of output 76 [2024-08-23 17:00:16,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:16,963 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 20 treesize of output 21 [2024-08-23 17:00:16,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:00:16,971 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 18 treesize of output 10 [2024-08-23 17:00:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251253654] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:17,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-08-23 17:00:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765783092] [2024-08-23 17:00:17,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-23 17:00:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-23 17:00:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=307, Unknown=2, NotChecked=74, Total=462 [2024-08-23 17:00:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:17,006 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:17,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:17,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:17,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:17,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< 64 c_~next_alloc_idx~0)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (< 0 c_~top~0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or .cse1 (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-23 17:00:17,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (= .cse0 3) (< 0 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-23 17:00:18,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0))) is different from false [2024-08-23 17:00:18,757 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-23 17:00:18,863 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (< 0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:00:18,968 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:00:19,616 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:00:19,688 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:00:21,778 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (= .cse0 3) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0))) is different from false [2024-08-23 17:00:22,079 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (< 0 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:22,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-08-23 17:00:22,897 WARN L477 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-08-23 17:00:22,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:22,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 254653069, now seen corresponding path program 2 times [2024-08-23 17:00:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414344314] [2024-08-23 17:00:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:22,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414344314] [2024-08-23 17:00:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414344314] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:23,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829744789] [2024-08-23 17:00:23,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:00:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:23,159 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-08-23 17:00:23,160 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-08-23 17:00:23,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-23 17:00:23,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:23,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-23 17:00:23,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:23,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:23,330 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 13 treesize of output 9 [2024-08-23 17:00:23,405 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-08-23 17:00:23,406 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 60 treesize of output 69 [2024-08-23 17:00:23,429 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-08-23 17:00:23,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:23,746 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 88 treesize of output 60 [2024-08-23 17:00:23,750 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 35 treesize of output 33 [2024-08-23 17:00:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-23 17:00:23,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:00:23,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829744789] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:00:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:00:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2024-08-23 17:00:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956822579] [2024-08-23 17:00:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:00:23,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-23 17:00:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-23 17:00:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-08-23 17:00:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:23,833 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:23,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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-08-23 17:00:23,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-23 17:00:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:25,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-08-23 17:00:25,701 WARN L477 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-08-23 17:00:25,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:25,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 358001874, now seen corresponding path program 4 times [2024-08-23 17:00:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425429222] [2024-08-23 17:00:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:26,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425429222] [2024-08-23 17:00:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425429222] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:26,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743094307] [2024-08-23 17:00:26,047 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-23 17:00:26,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:26,049 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:00:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-23 17:00:26,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-23 17:00:26,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:26,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-23 17:00:26,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:26,208 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-08-23 17:00:26,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:26,365 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-23 17:00:26,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-08-23 17:00:26,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 [2024-08-23 17:00:26,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:00:26,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:00:26,507 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 19 treesize of output 18 [2024-08-23 17:00:26,566 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-23 17:00:26,567 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 1 case distinctions, treesize of input 23 treesize of output 25 [2024-08-23 17:00:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:26,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:26,682 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65)) (or (forall ((v_DerPreprocessor_12 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:00:26,731 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:00:26,875 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-23 17:00:27,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:27,773 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-23 17:00:27,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:27,789 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-23 17:00:27,917 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 195 treesize of output 183 [2024-08-23 17:00:27,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:00:27,963 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 9 treesize of output 7 [2024-08-23 17:00:27,967 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-08-23 17:00:28,034 INFO L349 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2024-08-23 17:00:28,034 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 4 case distinctions, treesize of input 174 treesize of output 216 [2024-08-23 17:00:28,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:28,065 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 268 treesize of output 263 [2024-08-23 17:00:28,083 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 159 treesize of output 157 [2024-08-23 17:00:28,092 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 157 treesize of output 155 [2024-08-23 17:00:28,101 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 155 treesize of output 153 [2024-08-23 17:00:28,110 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 153 treesize of output 151 [2024-08-23 17:00:28,236 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 8 treesize of output 6 [2024-08-23 17:00:28,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:28,253 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 27 treesize of output 31 [2024-08-23 17:00:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743094307] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:28,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:28,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-08-23 17:00:28,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027889616] [2024-08-23 17:00:28,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:28,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-08-23 17:00:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-08-23 17:00:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=626, Unknown=17, NotChecked=162, Total=930 [2024-08-23 17:00:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:28,424 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:28,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:28,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:28,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:28,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:30,009 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (<= c_~next_alloc_idx~0 62) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-23 17:00:30,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (<= c_~next_alloc_idx~0 62) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (< 0 c_~top~0) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse1 (= c_~next_alloc_idx~0 0) (and (or .cse2 (and (or (< 60 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_78 Int) (v_prenex_77 Int) (v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_77) 0))))) (forall ((v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (forall ((v_prenex_78 Int)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_79) 0))))))) (or (forall ((v_prenex_88 Int) (v_prenex_86 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_86 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_88) v_prenex_86) 0)) (not (= (select |c_#valid| v_prenex_86) 0)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_82 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_84 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_82) v_prenex_80) 0)) (not (= (select |c_#valid| v_prenex_84) 0))))))) (or .cse1 (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse2 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))))))))) is different from false [2024-08-23 17:00:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:31,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-08-23 17:00:31,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:31,826 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:31,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -953895350, now seen corresponding path program 2 times [2024-08-23 17:00:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991597086] [2024-08-23 17:00:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991597086] [2024-08-23 17:00:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991597086] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065863678] [2024-08-23 17:00:32,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:00:32,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:32,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:32,202 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-08-23 17:00:32,204 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-08-23 17:00:32,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-23 17:00:32,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:32,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-23 17:00:32,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:32,364 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-08-23 17:00:32,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:00:32,431 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-23 17:00:32,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-08-23 17:00:32,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:00:32,548 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-08-23 17:00:32,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2024-08-23 17:00:32,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:00:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:32,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:32,645 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (and (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-08-23 17:00:34,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:34,045 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-23 17:00:34,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:34,057 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-23 17:00:34,184 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 363 treesize of output 349 [2024-08-23 17:00:34,266 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-08-23 17:00:34,271 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 48 treesize of output 44 [2024-08-23 17:00:34,276 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-08-23 17:00:34,305 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 25 treesize of output 23 [2024-08-23 17:00:34,309 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 48 treesize of output 44 [2024-08-23 17:00:34,315 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 22 treesize of output 20 [2024-08-23 17:00:34,342 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 568 treesize of output 536 [2024-08-23 17:00:34,404 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 48 treesize of output 44 [2024-08-23 17:00:34,408 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 22 treesize of output 20 [2024-08-23 17:00:34,448 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-08-23 17:00:34,453 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 38 treesize of output 34 [2024-08-23 17:00:34,480 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 40 treesize of output 36 [2024-08-23 17:00:34,484 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 22 treesize of output 20 [2024-08-23 17:00:34,514 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 42 treesize of output 38 [2024-08-23 17:00:34,518 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 22 treesize of output 20 [2024-08-23 17:00:34,605 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-08-23 17:00:34,607 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 38 treesize of output 34 [2024-08-23 17:00:34,627 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 17 treesize of output 15 [2024-08-23 17:00:34,629 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 20 [2024-08-23 17:00:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:00:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065863678] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:34,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-08-23 17:00:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886312123] [2024-08-23 17:00:34,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:34,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-23 17:00:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-23 17:00:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=433, Unknown=3, NotChecked=44, Total=600 [2024-08-23 17:00:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:34,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:34,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:34,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:34,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-08-23 17:00:34,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:34,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-23 17:00:34,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:38,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:00:46,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-23 17:00:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-23 17:00:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-08-23 17:00:46,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-08-23 17:00:46,291 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:00:46,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:00:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -180467686, now seen corresponding path program 5 times [2024-08-23 17:00:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:00:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619981374] [2024-08-23 17:00:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:00:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:00:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:00:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:00:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619981374] [2024-08-23 17:00:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619981374] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:00:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773193945] [2024-08-23 17:00:46,593 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-23 17:00:46,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:00:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:00:46,595 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-08-23 17:00:46,597 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-08-23 17:00:46,751 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-08-23 17:00:46,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:00:46,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-23 17:00:46,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:00:46,765 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-08-23 17:00:46,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:00:46,847 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-23 17:00:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-08-23 17:00:46,876 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-08-23 17:00:46,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 [2024-08-23 17:00:46,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:00:46,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:00:47,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:00:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:47,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:00:47,272 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_1196 Int) (v_DerPreprocessor_20 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:00:47,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:00:47,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:00:47,745 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2024-08-23 17:00:47,745 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 156 [2024-08-23 17:00:47,756 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 168 treesize of output 166 [2024-08-23 17:00:47,763 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 138 treesize of output 136 [2024-08-23 17:00:47,768 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 136 treesize of output 134 [2024-08-23 17:00:47,773 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 134 treesize of output 132 [2024-08-23 17:00:47,777 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 132 treesize of output 130 [2024-08-23 17:00:47,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 130 treesize of output 128 [2024-08-23 17:00:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:00:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773193945] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:00:47,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:00:47,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2024-08-23 17:00:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522230832] [2024-08-23 17:00:47,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:00:47,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-23 17:00:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:00:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-23 17:00:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=635, Unknown=13, NotChecked=52, Total=812 [2024-08-23 17:00:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:47,989 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:00:47,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-23 17:00:47,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-08-23 17:00:47,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:00:49,928 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_20 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (not (= c_~top~0 0)) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:00:55,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:01:03,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:01:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:01:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:01:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:01:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-23 17:01:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:01:04,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-23 17:01:04,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-08-23 17:01:04,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:01:04,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:01:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1662094232, now seen corresponding path program 3 times [2024-08-23 17:01:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:01:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896212877] [2024-08-23 17:01:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:01:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:01:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:01:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:01:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:01:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896212877] [2024-08-23 17:01:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896212877] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:01:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402427017] [2024-08-23 17:01:05,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-23 17:01:05,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:01:05,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:01:05,131 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-08-23 17:01:05,132 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-08-23 17:01:05,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-23 17:01:05,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:01:05,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 17:01:05,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:01:05,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:01:05,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:01:05,332 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-08-23 17:01:05,332 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 28 treesize of output 23 [2024-08-23 17:01:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:01:05,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:01:06,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:01:06,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:01:06,167 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:01:06,168 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 296 treesize of output 286 [2024-08-23 17:01:06,175 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 176 treesize of output 168 [2024-08-23 17:01:06,179 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 164 treesize of output 156 [2024-08-23 17:01:06,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:01:06,197 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 476 treesize of output 468 [2024-08-23 17:01:06,216 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 261 treesize of output 253 [2024-08-23 17:01:06,311 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 8 treesize of output 6 [2024-08-23 17:01:06,321 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 8 treesize of output 6 [2024-08-23 17:01:06,349 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 121 treesize of output 119 [2024-08-23 17:01:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:01:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402427017] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:01:06,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:01:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-08-23 17:01:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739572660] [2024-08-23 17:01:06,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:01:06,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-23 17:01:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:01:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-23 17:01:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2024-08-23 17:01:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:01:06,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:01:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:01:06,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:01:06,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:01:06,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:01:06,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:01:06,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:01:06,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:01:11,655 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 [1] [2024-08-23 17:01:13,747 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 [1] [2024-08-23 17:01:15,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:01:16,453 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse10 (< c_~next_alloc_idx~0 65)) (.cse11 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (or .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse1 64) (<= 0 .cse1)))) (<= 0 c_~top~0) (or .cse0 (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (< c_~next_alloc_idx~0 63)) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| (+ c_~next_alloc_idx~0 2))) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))))) (or .cse0 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse6 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))))) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< (select (select (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_196 (Array Int Int)) (v_prenex_197 Int) (v_prenex_195 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse9 v_prenex_195) v_prenex_197) 1) 0)) (< 0 (+ (select (select (store .cse9 v_prenex_195 v_prenex_196) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) .cse10) (or .cse10 (and (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse10 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= .cse11 64) (<= 0 .cse11) (<= c_~top~0 64))) is different from false [2024-08-23 17:01:16,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse10 (< c_~next_alloc_idx~0 65)) (.cse11 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (or .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse1 64) (<= 0 .cse1)))) (or .cse0 (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store .cse2 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (< c_~next_alloc_idx~0 63)) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse4 (select .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| (+ c_~next_alloc_idx~0 2))) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))))) (or .cse0 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse6 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))))) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< (select (select (store .cse8 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_196 (Array Int Int)) (v_prenex_197 Int) (v_prenex_195 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse9 v_prenex_195) v_prenex_197) 1) 0)) (< 0 (+ (select (select (store .cse9 v_prenex_195 v_prenex_196) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) .cse10) (or .cse10 (and (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse10 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (<= .cse11 64) (<= 0 .cse11))) is different from false [2024-08-23 17:01:21,284 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 [1] [2024-08-23 17:01:23,635 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 [1] [2024-08-23 17:01:25,676 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 [1] [2024-08-23 17:01:29,086 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 [1] [2024-08-23 17:01:36,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:01:38,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:02:00,790 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 [1] [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:01,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-23 17:02:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-08-23 17:02:01,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:02:01,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:02:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2103920734, now seen corresponding path program 6 times [2024-08-23 17:02:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:02:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179714849] [2024-08-23 17:02:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:02:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:02:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:02:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:02:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:02:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179714849] [2024-08-23 17:02:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179714849] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:02:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624619272] [2024-08-23 17:02:02,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-23 17:02:02,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:02:02,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:02:02,177 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-08-23 17:02:02,178 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-08-23 17:02:02,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-23 17:02:02,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:02:02,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-23 17:02:02,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:02:02,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 39 treesize of output 46 [2024-08-23 17:02:02,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:02:02,387 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-08-23 17:02:02,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:02:02,563 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-23 17:02:02,563 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 57 treesize of output 85 [2024-08-23 17:02:02,625 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-08-23 17:02:02,693 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-23 17:02:02,694 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 57 treesize of output 58 [2024-08-23 17:02:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:02:02,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:02,717 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 37 treesize of output 37 [2024-08-23 17:02:03,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:03,044 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 51 treesize of output 35 [2024-08-23 17:02:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-23 17:02:03,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:02:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624619272] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:02:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:02:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-08-23 17:02:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973360001] [2024-08-23 17:02:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:02:03,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-23 17:02:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:02:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-23 17:02:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-08-23 17:02:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:03,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:02:03,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:02:03,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:03,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:03,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:06,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-08-23 17:02:06,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:02:06,286 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:02:06,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:02:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1048605138, now seen corresponding path program 7 times [2024-08-23 17:02:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:02:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188164509] [2024-08-23 17:02:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:02:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:02:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:02:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:02:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:02:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188164509] [2024-08-23 17:02:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188164509] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:02:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295715571] [2024-08-23 17:02:06,789 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-23 17:02:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:02:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:02:06,791 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-08-23 17:02:06,792 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-08-23 17:02:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:02:06,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 17:02:06,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:02:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:02:07,087 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 15 treesize of output 1 [2024-08-23 17:02:07,139 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-23 17:02:07,139 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 19 treesize of output 22 [2024-08-23 17:02:07,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:07,319 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 31 treesize of output 23 [2024-08-23 17:02:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:02:07,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:02:07,638 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (< 0 (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_29 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_29) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-08-23 17:02:17,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:17,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:02:17,694 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 127 treesize of output 117 [2024-08-23 17:02:17,699 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-08-23 17:02:17,703 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 9 treesize of output 7 [2024-08-23 17:02:17,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:17,746 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-08-23 17:02:17,754 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 31 treesize of output 23 [2024-08-23 17:02:17,762 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 9 treesize of output 7 [2024-08-23 17:02:17,795 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 9 treesize of output 7 [2024-08-23 17:02:17,803 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-08-23 17:02:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:02:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295715571] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:02:17,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:02:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 18 [2024-08-23 17:02:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860950388] [2024-08-23 17:02:17,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:02:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-23 17:02:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:02:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-23 17:02:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=247, Unknown=3, NotChecked=32, Total=342 [2024-08-23 17:02:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:17,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:02:17,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 18 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:17,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:20,614 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 [1] [2024-08-23 17:02:22,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:02:24,623 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 [1] [2024-08-23 17:02:26,626 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 [1] [2024-08-23 17:02:29,006 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 [1] [2024-08-23 17:02:31,010 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 [1] [2024-08-23 17:02:33,013 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 [1] [2024-08-23 17:02:35,016 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 [1] [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-23 17:02:44,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-08-23 17:02:44,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-23 17:02:44,204 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:02:44,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:02:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -18328603, now seen corresponding path program 2 times [2024-08-23 17:02:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:02:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018431972] [2024-08-23 17:02:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:02:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:02:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:02:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:02:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:02:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018431972] [2024-08-23 17:02:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018431972] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:02:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789514637] [2024-08-23 17:02:44,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:02:44,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:02:44,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:02:44,368 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-08-23 17:02:44,369 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-08-23 17:02:44,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-23 17:02:44,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:02:44,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-23 17:02:44,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:02:44,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 8 treesize of output 1 [2024-08-23 17:02:44,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:02:44,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:02:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:02:44,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:02:45,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:02:45,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:02:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:02:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789514637] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:02:45,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:02:45,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-23 17:02:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859412720] [2024-08-23 17:02:45,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:02:45,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-23 17:02:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:02:45,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-23 17:02:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-23 17:02:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:45,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:02:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:02:45,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-23 17:02:45,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:02:50,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:02:51,146 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse2 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (= c_~next_alloc_idx~0 3) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or .cse0 (and (or .cse3 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))) .cse1))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse4) (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 0) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (= c_~next_alloc_idx~0 0) (and (or .cse1 (and (or (< 60 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_78 Int) (v_prenex_77 Int) (v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_77) 0))))) (forall ((v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (forall ((v_prenex_78 Int)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_79) 0))))))) (or (forall ((v_prenex_88 Int) (v_prenex_86 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_86 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_88) v_prenex_86) 0)) (not (= (select |c_#valid| v_prenex_86) 0)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_82 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_84 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_82) v_prenex_80) 0)) (not (= (select |c_#valid| v_prenex_84) 0))))))) (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-23 17:03:06,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse4 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (let ((.cse2 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) (or (and (or .cse0 (and (or .cse3 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))) .cse1))) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-23 17:03:53,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:03:57,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:03:59,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:01,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:03,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:05,391 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 [1] [2024-08-23 17:04:07,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:08,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:10,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:12,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:14,621 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 [1] [2024-08-23 17:04:15,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:18,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:04:20,037 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 [1] [2024-08-23 17:04:22,074 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 [1] [2024-08-23 17:04:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-23 17:04:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-23 17:04:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:04:22,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-23 17:04:22,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-23 17:04:22,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-23 17:04:22,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-08-23 17:04:22,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-23 17:04:22,585 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1] [2024-08-23 17:04:22,585 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE (1/4) [2024-08-23 17:04:22,587 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:04:22,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 17:04:22,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:22,589 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 17:04:22,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-08-23 17:04:22,594 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 17:04:22,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-23 17:04:22,594 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:04:22,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-23 17:04:22,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:04:22,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1034262692, now seen corresponding path program 1 times [2024-08-23 17:04:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585088646] [2024-08-23 17:04:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-23 17:04:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585088646] [2024-08-23 17:04:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585088646] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:22,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 17:04:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 17:04:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355927093] [2024-08-23 17:04:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:22,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:04:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:22,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:04:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 17:04:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:22,775 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:22,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:22,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:22,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-23 17:04:22,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:04:22,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 24134340, now seen corresponding path program 1 times [2024-08-23 17:04:22,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:22,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479644844] [2024-08-23 17:04:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 17:04:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479644844] [2024-08-23 17:04:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479644844] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361247893] [2024-08-23 17:04:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:23,066 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-08-23 17:04:23,067 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-08-23 17:04:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:23,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-23 17:04:23,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:23,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-23 17:04:23,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:04:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361247893] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:04:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-23 17:04:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867282839] [2024-08-23 17:04:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:04:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:04:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-23 17:04:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:23,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:23,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-08-23 17:04:23,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:23,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:04:23,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 665710870, now seen corresponding path program 1 times [2024-08-23 17:04:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198816494] [2024-08-23 17:04:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-23 17:04:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198816494] [2024-08-23 17:04:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198816494] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:23,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 17:04:23,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-23 17:04:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865161194] [2024-08-23 17:04:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:23,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-23 17:04:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-23 17:04:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-23 17:04:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:23,632 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:23,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:23,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-23 17:04:23,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-08-23 17:04:23,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-23 17:04:23,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash 117609650, now seen corresponding path program 1 times [2024-08-23 17:04:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693105480] [2024-08-23 17:04:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 17:04:23,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-23 17:04:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-23 17:04:23,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-23 17:04:23,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-23 17:04:23,902 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-23 17:04:23,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-08-23 17:04:23,903 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-23 17:04:23,903 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-08-23 17:04:23,903 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-23 17:04:23,903 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-23 17:04:23,933 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-23 17:04:23,936 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:04:23,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-23 17:04:23,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:23,939 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-23 17:04:23,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-08-23 17:04:23,942 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-23 17:04:23,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-08-23 17:04:23,942 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29ed7d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-23 17:04:23,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-23 17:04:24,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:24,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1499481995, now seen corresponding path program 1 times [2024-08-23 17:04:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989865225] [2024-08-23 17:04:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:04:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989865225] [2024-08-23 17:04:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989865225] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-23 17:04:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-23 17:04:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211732273] [2024-08-23 17:04:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:04:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:24,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:04:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-23 17:04:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:24,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:24,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:24,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:24,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-08-23 17:04:24,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:24,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash 271572029, now seen corresponding path program 1 times [2024-08-23 17:04:24,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:24,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230792160] [2024-08-23 17:04:24,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230792160] [2024-08-23 17:04:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230792160] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574329110] [2024-08-23 17:04:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:24,440 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-08-23 17:04:24,442 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-08-23 17:04:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:24,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-23 17:04:24,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:24,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:24,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:04:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574329110] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:04:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-23 17:04:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688685360] [2024-08-23 17:04:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:24,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-23 17:04:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-23 17:04:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-23 17:04:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:24,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:24,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:26,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-08-23 17:04:26,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-08-23 17:04:26,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:26,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1736072425, now seen corresponding path program 1 times [2024-08-23 17:04:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149688032] [2024-08-23 17:04:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149688032] [2024-08-23 17:04:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149688032] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671492108] [2024-08-23 17:04:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:26,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:26,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:26,558 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:26,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-08-23 17:04:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:26,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-23 17:04:26,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:26,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:26,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:04:27,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:27,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:04:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671492108] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:04:27,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:04:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-23 17:04:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664886586] [2024-08-23 17:04:27,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:04:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-23 17:04:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-23 17:04:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-23 17:04:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:27,087 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:27,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:27,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:27,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:27,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:29,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-08-23 17:04:29,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-08-23 17:04:29,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:29,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1638380063, now seen corresponding path program 1 times [2024-08-23 17:04:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969387993] [2024-08-23 17:04:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969387993] [2024-08-23 17:04:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969387993] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693210414] [2024-08-23 17:04:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:29,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:29,678 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-08-23 17:04:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:29,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-23 17:04:29,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:29,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:29,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:30,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:04:30,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:04:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693210414] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:04:30,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:04:30,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-23 17:04:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781040822] [2024-08-23 17:04:30,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:04:30,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-23 17:04:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-23 17:04:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-23 17:04:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:30,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:30,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:30,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:30,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:30,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:32,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-08-23 17:04:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-08-23 17:04:32,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:32,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1484172777, now seen corresponding path program 1 times [2024-08-23 17:04:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533999672] [2024-08-23 17:04:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533999672] [2024-08-23 17:04:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533999672] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656251607] [2024-08-23 17:04:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:33,267 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:33,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-08-23 17:04:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:33,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-23 17:04:33,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:33,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:33,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:33,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:33,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:33,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:04:34,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:34,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:04:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656251607] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:04:34,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:04:34,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-23 17:04:34,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210838649] [2024-08-23 17:04:34,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:04:34,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-23 17:04:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:34,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-23 17:04:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-08-23 17:04:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:34,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:34,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:34,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:34,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:34,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:34,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:36,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:04:36,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-08-23 17:04:36,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:36,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:36,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash -451042575, now seen corresponding path program 1 times [2024-08-23 17:04:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010485406] [2024-08-23 17:04:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010485406] [2024-08-23 17:04:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010485406] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384372681] [2024-08-23 17:04:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:37,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:37,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:37,166 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:37,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-08-23 17:04:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:37,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 17:04:37,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:37,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:37,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:37,421 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-08-23 17:04:37,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:04:37,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:04:37,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:04:37,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:04:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:37,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:04:37,990 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-08-23 17:04:38,005 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-08-23 17:04:38,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:04:39,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:04:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384372681] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:04:39,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:04:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-08-23 17:04:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732400783] [2024-08-23 17:04:39,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:04:39,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-23 17:04:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-23 17:04:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=434, Unknown=18, NotChecked=0, Total=552 [2024-08-23 17:04:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:39,112 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:04:39,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:39,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:39,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:39,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:39,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:04:39,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:04:55,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-23 17:04:55,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-08-23 17:04:55,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-08-23 17:04:55,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:55,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1788344206, now seen corresponding path program 1 times [2024-08-23 17:04:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149496652] [2024-08-23 17:04:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149496652] [2024-08-23 17:04:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149496652] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082163734] [2024-08-23 17:04:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:55,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:55,756 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:55,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-08-23 17:04:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:55,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-23 17:04:55,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:55,996 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 16 treesize of output 8 [2024-08-23 17:04:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-23 17:04:56,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:04:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082163734] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:04:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-23 17:04:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295050226] [2024-08-23 17:04:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:56,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-23 17:04:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:56,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-23 17:04:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-08-23 17:04:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:56,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:56,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-23 17:04:56,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:04:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:04:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:04:57,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-08-23 17:04:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-08-23 17:04:58,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:04:58,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:04:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash 423370484, now seen corresponding path program 2 times [2024-08-23 17:04:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:04:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196881855] [2024-08-23 17:04:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:04:58,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:04:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:04:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:04:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:04:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196881855] [2024-08-23 17:04:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196881855] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:04:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049601115] [2024-08-23 17:04:58,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:04:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:04:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:04:58,431 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:04:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-08-23 17:04:58,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-23 17:04:58,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:04:58,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-23 17:04:58,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:04:58,617 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 15 treesize of output 1 [2024-08-23 17:04:58,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:04:58,685 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-23 17:04:58,685 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 47 treesize of output 79 [2024-08-23 17:04:58,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:04:59,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:59,587 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 137 treesize of output 117 [2024-08-23 17:04:59,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:04:59,601 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 77 treesize of output 82 [2024-08-23 17:04:59,606 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 73 treesize of output 69 [2024-08-23 17:04:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-23 17:04:59,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:04:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049601115] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:04:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:04:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-08-23 17:04:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320558646] [2024-08-23 17:04:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:04:59,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-23 17:04:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:04:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-23 17:04:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=368, Unknown=1, NotChecked=0, Total=420 [2024-08-23 17:04:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:04:59,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:04:59,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:04:59,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:05:04,307 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-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:05:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:05:05,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-08-23 17:05:05,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-08-23 17:05:05,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:05:05,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:05:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1457489570, now seen corresponding path program 3 times [2024-08-23 17:05:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:05:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734832514] [2024-08-23 17:05:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:05:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:05:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:05:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:05:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:05:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734832514] [2024-08-23 17:05:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734832514] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:05:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581264309] [2024-08-23 17:05:06,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-23 17:05:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:05:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:05:06,158 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:05:06,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-08-23 17:05:06,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-23 17:05:06,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:05:06,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-23 17:05:06,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:05:06,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:05:06,356 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 15 treesize of output 1 [2024-08-23 17:05:06,444 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-23 17:05:06,444 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 47 treesize of output 79 [2024-08-23 17:05:06,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 5 treesize of output 3 [2024-08-23 17:05:07,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:05:07,352 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 131 treesize of output 115 [2024-08-23 17:05:07,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:05:07,372 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 75 treesize of output 80 [2024-08-23 17:05:07,379 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 71 treesize of output 67 [2024-08-23 17:05:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-23 17:05:07,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:05:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581264309] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:05:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:05:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2024-08-23 17:05:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126148277] [2024-08-23 17:05:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:05:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-23 17:05:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:05:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-23 17:05:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=329, Unknown=4, NotChecked=0, Total=380 [2024-08-23 17:05:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:05:07,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:05:07,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-08-23 17:05:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:05:07,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:05:09,598 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-08-23 17:05:12,411 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-08-23 17:05:14,530 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)) (.cse2 (not (= .cse3 0)))) (and (<= .cse0 64) (not (= c_~top~0 0)) (let ((.cse1 (= |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (or (and (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (<= (select v_DerPreprocessor_41 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse1) (and .cse2 (or (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) .cse3) (<= (select v_DerPreprocessor_41 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0))) (and (= |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) .cse1))))) (not (= .cse0 0)) (or (and .cse2 (or (and (<= c_~top~0 .cse3) (<= .cse3 64)) (exists ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse4 (select (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (and (<= c_~top~0 .cse4) (<= .cse4 64) (not (= .cse4 0)) (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) .cse3) (<= (select v_DerPreprocessor_41 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse5 64) (<= (select v_DerPreprocessor_41 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= .cse5 0)) (<= c_~top~0 .cse5)))))))) is different from true [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:05:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:05:14,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:05:14,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-08-23 17:05:15,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-08-23 17:05:15,162 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:05:15,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:05:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -895613426, now seen corresponding path program 4 times [2024-08-23 17:05:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:05:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781796372] [2024-08-23 17:05:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:05:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:05:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:05:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:05:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:05:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781796372] [2024-08-23 17:05:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781796372] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:05:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174450135] [2024-08-23 17:05:15,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-23 17:05:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:05:15,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:05:15,467 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:05:15,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-08-23 17:05:15,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-23 17:05:15,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:05:15,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-23 17:05:15,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:05:15,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:05:15,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:05:15,742 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-08-23 17:05:15,790 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:05:15,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:05:15,800 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 15 treesize of output 1 [2024-08-23 17:05:15,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:05:15,859 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 15 treesize of output 7 [2024-08-23 17:05:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:05:15,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:05:15,957 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-23 17:05:16,221 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-08-23 17:05:16,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 10 treesize of output 8 [2024-08-23 17:05:19,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:05:19,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:05:19,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:05:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:05:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174450135] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:05:19,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:05:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-08-23 17:05:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181044981] [2024-08-23 17:05:19,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:05:19,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-23 17:05:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:05:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-23 17:05:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=331, Unknown=8, NotChecked=38, Total=462 [2024-08-23 17:05:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:05:19,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:05:19,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 21 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:05:19,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-23 17:05:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:05:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:05:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:05:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:05:22,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 [1] [2024-08-23 17:05:26,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (<= 5 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:05:30,561 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 [1] [2024-08-23 17:05:33,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (<= 5 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse1 v_prenex_346 (store (select .cse1 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:05:35,891 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 [1] [2024-08-23 17:05:44,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 c_~top~0) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:05:51,693 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 [1] [2024-08-23 17:05:58,191 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse1 v_prenex_346 (store (select .cse1 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 c_~top~0) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:06:00,948 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 [1] [2024-08-23 17:06:03,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:06:04,116 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse0 v_prenex_346 (store (select .cse0 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse1 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))))) is different from false [2024-08-23 17:06:04,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (<= 5 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse0 v_prenex_346 (store (select .cse0 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse1) (or .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse1 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-23 17:06:06,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:06:13,720 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 [1] [2024-08-23 17:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:06:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:06:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:06:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:06:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:06:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:06:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:06:18,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-08-23 17:06:18,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:06:18,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:06:18,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:06:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -672411176, now seen corresponding path program 5 times [2024-08-23 17:06:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:06:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380823000] [2024-08-23 17:06:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:06:18,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:06:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:06:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:06:19,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:06:19,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380823000] [2024-08-23 17:06:19,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380823000] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:06:19,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907967887] [2024-08-23 17:06:19,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-23 17:06:19,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:06:19,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:06:19,088 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:06:19,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-08-23 17:06:19,347 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-08-23 17:06:19,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:06:19,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-23 17:06:19,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:06:19,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:06:19,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:06:19,494 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-08-23 17:06:19,540 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-23 17:06:19,540 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 14 treesize of output 13 [2024-08-23 17:06:19,588 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:06:19,588 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 27 treesize of output 27 [2024-08-23 17:06:19,685 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-08-23 17:06:19,685 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 4 case distinctions, treesize of input 40 treesize of output 50 [2024-08-23 17:06:19,819 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-08-23 17:06:19,819 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 43 treesize of output 49 [2024-08-23 17:06:20,045 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-08-23 17:06:20,046 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 33 treesize of output 33 [2024-08-23 17:06:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:06:20,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:06:20,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-23 17:06:20,205 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) is different from false [2024-08-23 17:06:20,410 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 38 treesize of output 36 [2024-08-23 17:06:20,523 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 38 treesize of output 36 [2024-08-23 17:06:24,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:06:24,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:06:25,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:06:25,148 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 150 treesize of output 142 [2024-08-23 17:06:25,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:06:25,177 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 328 treesize of output 320 [2024-08-23 17:06:25,192 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 70 treesize of output 66 [2024-08-23 17:06:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:06:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907967887] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:06:25,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:06:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-08-23 17:06:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838784852] [2024-08-23 17:06:25,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:06:25,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-23 17:06:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:06:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-23 17:06:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=8, NotChecked=94, Total=702 [2024-08-23 17:06:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:06:25,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:06:25,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 26 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:06:25,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:06:25,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 3)) (.cse8 (< c_~next_alloc_idx~0 65)) (.cse6 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse5 (< 64 c_~next_alloc_idx~0)) (.cse2 (+ c_~next_alloc_idx~0 2)) (.cse3 (< c_~next_alloc_idx~0 63))) (and (not (= .cse0 0)) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse2))) (or .cse3 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse5) (<= c_~next_alloc_idx~0 60) (<= 0 .cse0) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse6 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse5) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse8) (or .cse8 (and (or .cse6 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or .cse5 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse2))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse10 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse2) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse10) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse10 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse11 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse11 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse11 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse3))))) is different from false [2024-08-23 17:06:25,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 3)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse6 (< c_~next_alloc_idx~0 65)) (.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0)))) (and (not (= .cse0 0)) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse3) (<= c_~next_alloc_idx~0 60) (<= 0 .cse0) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse4 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse3) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse6) (or .cse6 (and (or .cse4 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))))) is different from false [2024-08-23 17:06:28,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next_alloc_idx~0 3)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (<= 5 (select .cse0 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or (= (select .cse0 0) 3) (= |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int)) (= (select (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) 0) 3))) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-23 17:06:30,222 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 [1] [2024-08-23 17:06:36,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse2 (+ c_~next_alloc_idx~0 3)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-23 17:06:37,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse3 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse5 (< c_~next_alloc_idx~0 65))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse0) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse0) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse3 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse0) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse5) (or .cse5 (and (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse5))) is different from false [2024-08-23 17:06:37,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< 64 c_~next_alloc_idx~0)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse3 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0)))) (and (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse0 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse3 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse2) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse5) (or .cse5 (and (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))))) is different from false [2024-08-23 17:06:38,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next_alloc_idx~0 3)) (.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (< 0 (select .cse0 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-23 17:06:49,547 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 [1] [2024-08-23 17:06:49,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (or .cse2 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse3 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse5 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse2) (or .cse2 (and (or .cse5 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse2))) is different from false [2024-08-23 17:06:51,956 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 [1] [2024-08-23 17:06:53,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:06:55,497 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 [1] [2024-08-23 17:06:56,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:06:59,207 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 [1] [2024-08-23 17:07:07,733 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-08-23 17:07:09,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-23 17:07:11,977 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-08-23 17:07:13,991 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-08-23 17:07:16,015 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-08-23 17:07:30,029 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 [1] [2024-08-23 17:07:32,044 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 [1] [2024-08-23 17:07:34,066 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 [1] [2024-08-23 17:07:36,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:07:38,362 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 [1] [2024-08-23 17:07:40,381 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 [1] [2024-08-23 17:07:42,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:07:44,406 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 [1] [2024-08-23 17:07:46,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:07:59,219 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 [1] [2024-08-23 17:08:01,233 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 [1] [2024-08-23 17:08:13,932 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 [1] [2024-08-23 17:08:16,649 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 [1] [2024-08-23 17:08:17,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:08:19,931 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 [1] [2024-08-23 17:08:21,939 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 [1] [2024-08-23 17:08:23,955 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 [1] [2024-08-23 17:08:25,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:08:27,996 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 [1] [2024-08-23 17:08:30,005 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 [1] [2024-08-23 17:08:32,091 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 [1] [2024-08-23 17:08:34,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:08:36,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:08:38,606 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 [1] [2024-08-23 17:08:40,938 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 [1] [2024-08-23 17:08:43,481 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 [1] [2024-08-23 17:08:45,500 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 [1] [2024-08-23 17:08:47,519 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 [1] [2024-08-23 17:08:49,539 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 [1] [2024-08-23 17:08:52,706 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 [1] [2024-08-23 17:08:54,778 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 [1] [2024-08-23 17:08:56,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:08:58,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:09:01,245 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 [1] [2024-08-23 17:09:09,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:09:11,867 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 [1] [2024-08-23 17:09:14,647 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 [1] [2024-08-23 17:09:16,738 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-08-23 17:09:18,761 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-08-23 17:09:19,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-23 17:09:29,997 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-08-23 17:09:32,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-23 17:09:34,879 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-08-23 17:09:37,188 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-08-23 17:09:39,214 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-08-23 17:09:41,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-23 17:09:43,417 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-08-23 17:09:45,485 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-08-23 17:09:56,278 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 [1] [2024-08-23 17:09:58,288 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 [1] [2024-08-23 17:10:00,303 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 [1] [2024-08-23 17:10:02,592 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 [1] [2024-08-23 17:10:04,606 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 [1] [2024-08-23 17:10:06,616 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 [1] [2024-08-23 17:10:08,631 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 [1] [2024-08-23 17:10:10,634 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 [1] [2024-08-23 17:10:12,638 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-08-23 17:10:15,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-23 17:10:17,483 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-08-23 17:10:19,506 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 [1] [2024-08-23 17:10:21,509 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 [1] [2024-08-23 17:10:23,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:10:25,966 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 [1] [2024-08-23 17:10:27,989 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 [1] [2024-08-23 17:10:30,002 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 [1] [2024-08-23 17:10:32,015 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 [1] [2024-08-23 17:10:34,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 [1] [2024-08-23 17:10:36,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:10:38,061 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 [1] [2024-08-23 17:10:40,423 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 [1] [2024-08-23 17:10:42,425 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 [1] [2024-08-23 17:10:44,426 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 [1] [2024-08-23 17:10:46,427 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 [1] [2024-08-23 17:10:48,429 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 [1] [2024-08-23 17:10:50,430 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 [1] [2024-08-23 17:10:52,435 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-08-23 17:10:54,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:10:56,444 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 [1] [2024-08-23 17:10:58,446 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-08-23 17:11:00,451 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 [1] [2024-08-23 17:11:02,452 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 [1] [2024-08-23 17:11:04,454 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-08-23 17:11:06,455 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 [1] [2024-08-23 17:11:08,456 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 [1] [2024-08-23 17:11:10,461 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 [1] [2024-08-23 17:11:12,463 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-08-23 17:11:14,464 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 [1] [2024-08-23 17:11:16,468 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 [1] [2024-08-23 17:11:18,472 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 [1] [2024-08-23 17:11:25,479 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 [1] [2024-08-23 17:11:27,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:11:28,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:11:30,840 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 [1] [2024-08-23 17:11:32,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:11:34,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:11:38,196 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 [1] [2024-08-23 17:11:42,618 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 [1] [2024-08-23 17:11:45,176 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 [1] [2024-08-23 17:11:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:11:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:11:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:11:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:11:46,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-08-23 17:11:47,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:11:47,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:11:47,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:11:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1114844148, now seen corresponding path program 6 times [2024-08-23 17:11:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:11:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828363105] [2024-08-23 17:11:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:11:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:11:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:11:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:11:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:11:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828363105] [2024-08-23 17:11:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828363105] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:11:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547739685] [2024-08-23 17:11:47,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-23 17:11:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:11:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:11:47,441 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:11:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-08-23 17:11:47,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-23 17:11:47,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:11:47,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-23 17:11:47,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:11:47,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:11:47,716 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 15 treesize of output 1 [2024-08-23 17:11:47,804 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-08-23 17:11:47,805 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 47 treesize of output 60 [2024-08-23 17:11:47,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 0 case distinctions, treesize of input 16 treesize of output 5 [2024-08-23 17:11:48,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:11:48,618 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 114 treesize of output 90 [2024-08-23 17:11:48,623 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 62 treesize of output 58 [2024-08-23 17:11:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-23 17:11:48,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-23 17:11:48,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547739685] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-23 17:11:48,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-23 17:11:48,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 22 [2024-08-23 17:11:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8677021] [2024-08-23 17:11:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-23 17:11:48,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-23 17:11:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:11:48,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-23 17:11:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-08-23 17:11:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:11:48,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:11:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-08-23 17:11:48,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:11:48,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:11:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:11:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:11:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:11:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:11:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:11:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:11:56,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-08-23 17:11:56,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-08-23 17:11:56,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:11:56,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:11:56,930 INFO L85 PathProgramCache]: Analyzing trace with hash -72208018, now seen corresponding path program 7 times [2024-08-23 17:11:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:11:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451014072] [2024-08-23 17:11:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:11:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:11:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:11:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:11:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:11:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451014072] [2024-08-23 17:11:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451014072] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:11:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96927457] [2024-08-23 17:11:57,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-23 17:11:57,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:11:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:11:57,408 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:11:57,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-08-23 17:11:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:11:57,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-23 17:11:57,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:11:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:11:57,834 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-08-23 17:11:57,896 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-23 17:11:57,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-08-23 17:11:58,001 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-23 17:11:58,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-08-23 17:11:58,055 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 15 treesize of output 1 [2024-08-23 17:11:58,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 [2024-08-23 17:11:58,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:11:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:11:58,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:11:58,303 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 15 treesize of output 7 [2024-08-23 17:11:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:11:58,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:11:58,448 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_52 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((v_DerPreprocessor_53 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:11:58,864 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-23 17:12:00,123 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-23 17:12:00,124 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 48 treesize of output 44 [2024-08-23 17:12:00,161 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-23 17:12:00,162 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 94 treesize of output 88 [2024-08-23 17:12:00,364 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-23 17:12:00,364 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 48 treesize of output 44 [2024-08-23 17:12:00,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-23 17:12:00,397 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 18 treesize of output 16 [2024-08-23 17:12:01,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:01,676 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-23 17:12:01,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:01,690 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-23 17:12:01,887 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 168 treesize of output 156 [2024-08-23 17:12:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:12:01,967 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 139 treesize of output 131 [2024-08-23 17:12:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:12:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96927457] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:12:02,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:12:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-08-23 17:12:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940912818] [2024-08-23 17:12:02,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:12:02,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-23 17:12:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:12:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-23 17:12:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=749, Unknown=23, NotChecked=118, Total=1056 [2024-08-23 17:12:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:02,061 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:12:02,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:12:02,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:02,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:02,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:02,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:03,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse6 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_prenex_493 Int) (v_prenex_494 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| v_prenex_494 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_493) v_prenex_496) 0)) (not (= (select |c_#valid| v_prenex_494) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495))))) (or .cse2 (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_488 Int) (v_prenex_489 Int) (v_prenex_487 Int) (v_prenex_491 Int) (v_DerPreprocessor_56 (Array Int Int)) (v_prenex_490 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_489 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_488) v_prenex_491) 0)) (not (= (select |c_#valid| v_prenex_489) 0)) (< v_prenex_487 .cse3) (< 0 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse4 v_prenex_489 (store (select .cse4 v_prenex_489) v_prenex_490 v_prenex_487))) v_prenex_491 v_DerPreprocessor_52) v_prenex_489) v_prenex_490)))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937))) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2937 .cse3)))))))) (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 .cse3))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse1)) .cse0) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 4 c_~top~0) (or .cse6 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse7 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse1 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse7 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse2 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse7 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse0) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse6) (or .cse6 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) is different from false [2024-08-23 17:12:05,876 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (< 62 c_~next_alloc_idx~0)) (.cse4 (+ c_~next_alloc_idx~0 2)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)))) .cse0) (or .cse1 (and (or .cse2 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_prenex_493 Int) (v_prenex_494 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| v_prenex_494 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_493) v_prenex_496) 0)) (not (= (select |c_#valid| v_prenex_494) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495))))) (or .cse3 (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_488 Int) (v_prenex_489 Int) (v_prenex_487 Int) (v_prenex_491 Int) (v_DerPreprocessor_56 (Array Int Int)) (v_prenex_490 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_489 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_488) v_prenex_491) 0)) (not (= (select |c_#valid| v_prenex_489) 0)) (< v_prenex_487 .cse4) (< 0 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse5 v_prenex_489 (store (select .cse5 v_prenex_489) v_prenex_490 v_prenex_487))) v_prenex_491 v_DerPreprocessor_52) v_prenex_489) v_prenex_490)))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937))) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2937 .cse4)))))))) (or (and (or (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))) .cse2) (or .cse3 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 .cse4))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse2)) .cse1) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 4 c_~top~0) (or (forall ((v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (or .cse1 (forall ((v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0))))) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse0 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse0 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) is different from false [2024-08-23 17:12:07,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse6 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_prenex_493 Int) (v_prenex_494 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| v_prenex_494 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_493) v_prenex_496) 0)) (not (= (select |c_#valid| v_prenex_494) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495))))) (or .cse2 (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_488 Int) (v_prenex_489 Int) (v_prenex_487 Int) (v_prenex_491 Int) (v_DerPreprocessor_56 (Array Int Int)) (v_prenex_490 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_489 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_488) v_prenex_491) 0)) (not (= (select |c_#valid| v_prenex_489) 0)) (< v_prenex_487 .cse3) (< 0 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse4 v_prenex_489 (store (select .cse4 v_prenex_489) v_prenex_490 v_prenex_487))) v_prenex_491 v_DerPreprocessor_52) v_prenex_489) v_prenex_490)))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937))) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2937 .cse3)))))))) (or (and (or (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))) .cse1) (or .cse2 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))))) .cse0) (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 .cse3))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse1)) .cse0) (< 4 c_~top~0) (or .cse6 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse6) (or .cse6 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) is different from false [2024-08-23 17:12:08,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 63)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 (+ c_~next_alloc_idx~0 2)))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse0)) .cse1) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 0 c_~top~0) (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse3 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse3 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse3 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse1) (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) is different from false [2024-08-23 17:12:11,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 63)) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse2 (< 64 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 65))) (and (or (and (or (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))) .cse0) (or .cse1 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0))))) .cse2) (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 (+ c_~next_alloc_idx~0 2)))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse0)) .cse2) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or .cse3 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse4 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) is different from false [2024-08-23 17:12:17,100 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 [1] [2024-08-23 17:12:19,108 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 [1] [2024-08-23 17:12:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:24,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-08-23 17:12:25,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-08-23 17:12:25,106 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:12:25,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:12:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1391017262, now seen corresponding path program 1 times [2024-08-23 17:12:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:12:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018879497] [2024-08-23 17:12:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:12:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:12:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:12:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:12:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:12:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018879497] [2024-08-23 17:12:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018879497] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:12:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507661666] [2024-08-23 17:12:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:12:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:12:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:12:25,177 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:12:25,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-08-23 17:12:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:12:25,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-23 17:12:25,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:12:25,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:12:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:12:25,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:12:25,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:25,571 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-23 17:12:25,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:25,587 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-23 17:12:25,623 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 37 treesize of output 23 [2024-08-23 17:12:25,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-23 17:12:25,636 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 20 treesize of output 12 [2024-08-23 17:12:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-23 17:12:25,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507661666] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:12:25,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:12:25,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-23 17:12:25,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350478142] [2024-08-23 17:12:25,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:12:25,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-23 17:12:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:12:25,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-23 17:12:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-23 17:12:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:25,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:12:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 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-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:25,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:12:27,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-08-23 17:12:28,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-08-23 17:12:28,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:12:28,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:12:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash -230568318, now seen corresponding path program 1 times [2024-08-23 17:12:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:12:28,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461637119] [2024-08-23 17:12:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:12:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:12:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:12:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:12:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461637119] [2024-08-23 17:12:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461637119] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:12:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213210521] [2024-08-23 17:12:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:12:28,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:12:28,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:12:28,376 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:12:28,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-08-23 17:12:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:12:28,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-23 17:12:28,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:12:28,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:12:28,627 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-08-23 17:12:28,656 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 15 treesize of output 1 [2024-08-23 17:12:28,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:12:28,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:12:28,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-23 17:12:28,797 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 15 treesize of output 7 [2024-08-23 17:12:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:28,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:12:28,897 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-23 17:12:29,083 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-08-23 17:12:29,093 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-08-23 17:12:29,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:29,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:12:29,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:29,411 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 18 treesize of output 19 [2024-08-23 17:12:29,413 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-23 17:12:29,415 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 17 treesize of output 9 [2024-08-23 17:12:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213210521] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:12:29,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:12:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-08-23 17:12:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477587789] [2024-08-23 17:12:29,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:12:29,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-23 17:12:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:12:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-23 17:12:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=304, Unknown=3, NotChecked=36, Total=420 [2024-08-23 17:12:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:29,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:12:29,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:29,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:29,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:29,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:29,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:29,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:12:29,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:29,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (< 0 c_~top~0) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-23 17:12:32,799 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= c_~next_alloc_idx~0 62) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:12:33,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:12:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-23 17:12:35,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-08-23 17:12:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-08-23 17:12:35,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-23 17:12:35,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-23 17:12:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 415785329, now seen corresponding path program 2 times [2024-08-23 17:12:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-23 17:12:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629211497] [2024-08-23 17:12:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-23 17:12:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-23 17:12:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-23 17:12:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-23 17:12:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629211497] [2024-08-23 17:12:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629211497] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-23 17:12:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656168301] [2024-08-23 17:12:36,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-23 17:12:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-23 17:12:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-23 17:12:36,156 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-23 17:12:36,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-08-23 17:12:36,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-23 17:12:36,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-23 17:12:36,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 28 conjunts are in the unsatisfiable core [2024-08-23 17:12:36,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-23 17:12:36,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-23 17:12:36,421 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-08-23 17:12:36,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-23 17:12:36,548 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-23 17:12:36,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-08-23 17:12:36,596 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-08-23 17:12:36,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-08-23 17:12:36,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:12:36,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-23 17:12:36,953 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-23 17:12:36,954 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 32 treesize of output 32 [2024-08-23 17:12:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:37,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-23 17:12:38,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-23 17:12:38,233 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 94 treesize of output 92 [2024-08-23 17:12:38,287 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-23 17:12:38,287 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 94 treesize of output 1 [2024-08-23 17:12:38,312 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-23 17:12:38,312 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 94 treesize of output 88 [2024-08-23 17:12:38,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-23 17:12:39,297 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-23 17:12:39,298 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 316 treesize of output 316 [2024-08-23 17:12:39,402 INFO L349 Elim1Store]: treesize reduction 69, result has 50.0 percent of original size [2024-08-23 17:12:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 413 treesize of output 453 [2024-08-23 17:12:39,413 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 147 treesize of output 145 [2024-08-23 17:12:39,423 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 145 treesize of output 143 [2024-08-23 17:12:39,431 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 143 treesize of output 141 [2024-08-23 17:12:39,587 INFO L349 Elim1Store]: treesize reduction 108, result has 44.9 percent of original size [2024-08-23 17:12:39,588 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 16 case distinctions, treesize of input 186 treesize of output 255 [2024-08-23 17:12:39,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:39,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 205 treesize of output 273 [2024-08-23 17:12:39,705 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 126 treesize of output 124 [2024-08-23 17:12:39,721 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 124 treesize of output 122 [2024-08-23 17:12:39,736 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 122 treesize of output 120 [2024-08-23 17:12:39,964 INFO L349 Elim1Store]: treesize reduction 12, result has 71.4 percent of original size [2024-08-23 17:12:39,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 61 [2024-08-23 17:12:40,024 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-23 17:12:40,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 26 [2024-08-23 17:12:40,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-23 17:12:40,056 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 79 treesize of output 77 [2024-08-23 17:12:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-23 17:12:40,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656168301] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-23 17:12:40,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-23 17:12:40,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 32 [2024-08-23 17:12:40,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403518331] [2024-08-23 17:12:40,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-23 17:12:40,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-23 17:12:40,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-23 17:12:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-23 17:12:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=865, Unknown=19, NotChecked=0, Total=1056 [2024-08-23 17:12:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:12:40,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-23 17:12:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.363636363636363) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-23 17:12:40,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-23 17:12:40,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-23 17:12:40,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-23 17:13:07,373 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-23 17:13:09,808 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:13:13,388 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 [1] [2024-08-23 17:13:14,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-23 17:13:18,372 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (< 0 (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0)) is different from false [2024-08-23 17:13:19,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= c_~next_alloc_idx~0 62) (or .cse0 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-23 17:13:27,692 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 [1] Killed by 15