./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 12:44:58,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 12:44:58,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-11 12:44:58,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 12:44:58,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 12:44:58,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 12:44:58,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 12:44:58,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 12:44:58,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 12:44:58,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 12:44:58,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 12:44:58,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 12:44:58,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 12:44:58,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 12:44:58,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 12:44:58,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 12:44:58,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 12:44:58,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 12:44:58,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 12:44:58,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 12:44:58,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 12:44:58,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 12:44:58,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 12:44:58,701 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-11 12:44:58,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 12:44:58,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 12:44:58,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 12:44:58,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 12:44:58,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 12:44:58,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 12:44:58,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 12:44:58,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 12:44:58,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:44:58,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 12:44:58,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 12:44:58,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 12:44:58,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 12:44:58,706 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-11 12:44:58,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 12:44:58,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 12:44:58,707 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 12:44:58,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 12:44:58,708 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 12:44:58,708 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 12:44:58,708 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-11 12:44:58,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 12:44:58,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 12:44:58,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 12:44:58,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 12:44:58,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 12:44:59,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longer.i [2024-11-11 12:45:00,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 12:45:00,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 12:45:00,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2024-11-11 12:45:00,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/65f6a46c6/5f689e90032c45c9b6cf6cea9ee90d72/FLAG0cf26c760 [2024-11-11 12:45:00,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/65f6a46c6/5f689e90032c45c9b6cf6cea9ee90d72 [2024-11-11 12:45:00,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 12:45:00,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 12:45:00,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:00,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 12:45:00,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 12:45:00,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:00" (1/1) ... [2024-11-11 12:45:00,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528fbe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:00, skipping insertion in model container [2024-11-11 12:45:00,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:00" (1/1) ... [2024-11-11 12:45:00,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 12:45:01,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:01,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 12:45:01,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:01,428 INFO L204 MainTranslator]: Completed translation [2024-11-11 12:45:01,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01 WrapperNode [2024-11-11 12:45:01,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:01,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:01,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 12:45:01,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 12:45:01,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,571 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1064 [2024-11-11 12:45:01,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:01,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 12:45:01,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 12:45:01,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 12:45:01,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 12:45:01,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 12:45:01,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 12:45:01,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 12:45:01,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (1/1) ... [2024-11-11 12:45:01,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:45:01,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:01,698 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-11-11 12:45:01,702 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-11-11 12:45:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 12:45:01,744 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 12:45:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 12:45:01,744 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 12:45:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 12:45:01,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 12:45:01,747 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 12:45:01,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 12:45:01,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 12:45:03,099 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 12:45:03,099 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 12:45:10,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 12:45:10,899 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 12:45:10,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:10 BoogieIcfgContainer [2024-11-11 12:45:10,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 12:45:10,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 12:45:10,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 12:45:10,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 12:45:10,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 12:45:00" (1/3) ... [2024-11-11 12:45:10,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7e37a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:10, skipping insertion in model container [2024-11-11 12:45:10,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:01" (2/3) ... [2024-11-11 12:45:10,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7e37a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:10, skipping insertion in model container [2024-11-11 12:45:10,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:10" (3/3) ... [2024-11-11 12:45:10,911 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-11 12:45:10,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 12:45:10,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-11 12:45:10,930 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 12:45:11,045 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 12:45:11,107 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:11,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 12:45:11,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:11,109 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-11-11 12:45:11,111 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-11-11 12:45:11,145 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 12:45:11,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 12:45:11,164 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@33b4134f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:11,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-11 12:45:11,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:11,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash -445045891, now seen corresponding path program 1 times [2024-11-11 12:45:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486232343] [2024-11-11 12:45:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486232343] [2024-11-11 12:45:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486232343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:45:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608778623] [2024-11-11 12:45:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:13,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:13,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 12:45:14,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:14,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -911518375, now seen corresponding path program 1 times [2024-11-11 12:45:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956837982] [2024-11-11 12:45:14,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:15,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956837982] [2024-11-11 12:45:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956837982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:15,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:45:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994706348] [2024-11-11 12:45:15,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:15,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:15,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:15,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:15,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:15,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:15,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 12:45:15,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 204245500, now seen corresponding path program 1 times [2024-11-11 12:45:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:15,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587594900] [2024-11-11 12:45:15,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587594900] [2024-11-11 12:45:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587594900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269903743] [2024-11-11 12:45:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:45:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:45:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 12:45:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:16,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:16,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:16,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:16,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:17,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 12:45:17,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 348172293, now seen corresponding path program 1 times [2024-11-11 12:45:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018901378] [2024-11-11 12:45:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018901378] [2024-11-11 12:45:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018901378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658085193] [2024-11-11 12:45:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:17,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:17,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:17,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:17,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:17,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:17,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:17,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:17,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 12:45:18,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 537222103, now seen corresponding path program 1 times [2024-11-11 12:45:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552811876] [2024-11-11 12:45:18,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:18,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552811876] [2024-11-11 12:45:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552811876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:18,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 12:45:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118084006] [2024-11-11 12:45:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:18,255 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-11-11 12:45:18,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:18,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:18,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 12:45:18,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:18,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1273962353, now seen corresponding path program 1 times [2024-11-11 12:45:18,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34958330] [2024-11-11 12:45:18,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34958330] [2024-11-11 12:45:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34958330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:45:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797874722] [2024-11-11 12:45:18,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:18,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:45:18,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:18,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:45:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 12:45:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:19,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1867 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 12:45:19,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:45:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:19,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 12:45:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797874722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 12:45:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-11 12:45:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610358523] [2024-11-11 12:45:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:45:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:45:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:19,438 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:19,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:19,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:19,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 12:45:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 12:45:19,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 838129670, now seen corresponding path program 1 times [2024-11-11 12:45:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087376569] [2024-11-11 12:45:19,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 12:45:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087376569] [2024-11-11 12:45:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087376569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:19,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487472361] [2024-11-11 12:45:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:19,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 12:45:20,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -825421080, now seen corresponding path program 1 times [2024-11-11 12:45:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551652360] [2024-11-11 12:45:20,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 12:45:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551652360] [2024-11-11 12:45:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551652360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652679922] [2024-11-11 12:45:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 12:45:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 12:45:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 12:45:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:20,358 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:20,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:20,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:20,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:20,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 12:45:21,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2137348113, now seen corresponding path program 1 times [2024-11-11 12:45:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910215428] [2024-11-11 12:45:21,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:21,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910215428] [2024-11-11 12:45:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910215428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360370517] [2024-11-11 12:45:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 12:45:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 12:45:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 12:45:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:21,339 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:21,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:21,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:21,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:21,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 12:45:21,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2122540414, now seen corresponding path program 1 times [2024-11-11 12:45:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283051986] [2024-11-11 12:45:21,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283051986] [2024-11-11 12:45:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283051986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:24,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:24,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217786240] [2024-11-11 12:45:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:24,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:24,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:24,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:24,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 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-11-11 12:45:24,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:24,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:24,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:24,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:24,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 12:45:25,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1374241009, now seen corresponding path program 1 times [2024-11-11 12:45:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:25,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615210021] [2024-11-11 12:45:25,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615210021] [2024-11-11 12:45:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615210021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:28,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:28,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379401411] [2024-11-11 12:45:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:28,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:28,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:28,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:28,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:28,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:28,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 12:45:28,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:28,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:28,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2090573356, now seen corresponding path program 1 times [2024-11-11 12:45:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457487129] [2024-11-11 12:45:28,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457487129] [2024-11-11 12:45:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457487129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039376699] [2024-11-11 12:45:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:31,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:31,175 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 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-11-11 12:45:31,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:31,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:31,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:31,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 12:45:31,580 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:31,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash -383262200, now seen corresponding path program 1 times [2024-11-11 12:45:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132354070] [2024-11-11 12:45:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132354070] [2024-11-11 12:45:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132354070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:33,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483501077] [2024-11-11 12:45:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:33,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:33,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:33,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:33,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:33,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:33,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:33,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:34,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 12:45:34,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash 434376798, now seen corresponding path program 1 times [2024-11-11 12:45:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:34,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606028716] [2024-11-11 12:45:34,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606028716] [2024-11-11 12:45:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606028716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:45:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704828106] [2024-11-11 12:45:38,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:38,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:45:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:38,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:45:38,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 12:45:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:39,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 1979 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 12:45:39,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:45:39,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 19 treesize of output 1 [2024-11-11 12:45:39,289 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 31 treesize of output 15 [2024-11-11 12:45:39,356 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 34 treesize of output 28 [2024-11-11 12:45:39,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:45:39,367 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 38 treesize of output 22 [2024-11-11 12:45:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:39,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:45:39,670 INFO L349 Elim1Store]: treesize reduction 51, result has 52.3 percent of original size [2024-11-11 12:45:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 195 [2024-11-11 12:45:39,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:45:39,689 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 154 treesize of output 148 [2024-11-11 12:45:39,704 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 5 [2024-11-11 12:45:39,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:45:39,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2024-11-11 12:45:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704828106] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 12:45:40,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 12:45:40,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16, 6] total 28 [2024-11-11 12:45:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577911677] [2024-11-11 12:45:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:40,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 12:45:40,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:40,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 12:45:40,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-11-11 12:45:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:40,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 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-11-11 12:45:40,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:40,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:40,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:41,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 12:45:41,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 12:45:41,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:41,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash 580781235, now seen corresponding path program 1 times [2024-11-11 12:45:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510564064] [2024-11-11 12:45:41,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510564064] [2024-11-11 12:45:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510564064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:45:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528237720] [2024-11-11 12:45:45,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:45,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:45:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:45,351 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-11-11 12:45:45,352 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-11-11 12:45:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:45,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-11 12:45:45,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:45:45,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-11 12:45:45,744 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 23 treesize of output 11 [2024-11-11 12:45:45,794 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 23 treesize of output 11 [2024-11-11 12:45:45,858 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 23 treesize of output 3 [2024-11-11 12:45:45,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:45:45,891 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-11-11 12:45:45,960 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:45:45,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-11 12:45:46,009 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 23 treesize of output 11 [2024-11-11 12:45:46,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:45:46,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:45:46,148 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 23 treesize of output 16 [2024-11-11 12:45:46,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:45:46,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:45:46,399 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-11-11 12:45:46,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2024-11-11 12:45:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:46,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:45:46,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647)))) is different from false [2024-11-11 12:45:46,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|))))) is different from false [2024-11-11 12:45:46,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_528) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< 2147483647 v_ArrVal_528))))) is different from false [2024-11-11 12:45:47,435 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (v_ArrVal_526 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_14| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_524)))) (let ((.cse3 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_526) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_14|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_528) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_524) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< 2147483647 v_ArrVal_528)))))) is different from false [2024-11-11 12:45:47,652 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (v_ArrVal_532 Int) (v_ArrVal_526 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_12| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_14| Int) (v_ArrVal_528 Int) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_524)))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_526) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_14|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_528) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_532) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_12|) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_524) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select .cse0 .cse1) (+ v_ArrVal_532 1)) (< 2147483647 v_ArrVal_528))))))) is different from false [2024-11-11 12:45:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-11 12:45:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528237720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:45:53,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:45:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 43 [2024-11-11 12:45:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034176752] [2024-11-11 12:45:53,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:45:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-11 12:45:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-11 12:45:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1301, Unknown=35, NotChecked=400, Total=1980 [2024-11-11 12:45:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:54,002 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:54,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.7045454545454546) internal successors, (163), 44 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:54,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:54,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:54,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:54,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:54,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:54,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:45:58,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 12:45:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:45:58,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -214905224, now seen corresponding path program 1 times [2024-11-11 12:45:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:58,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072972277] [2024-11-11 12:45:58,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:58,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072972277] [2024-11-11 12:46:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072972277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099821497] [2024-11-11 12:46:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:00,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:00,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:00,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:00,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 12:46:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:00,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-11 12:46:00,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:00,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-11 12:46:00,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:00,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-11 12:46:00,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:00,688 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 23 treesize of output 16 [2024-11-11 12:46:00,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:00,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-11 12:46:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:00,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-11 12:46:01,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:01,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-11 12:46:01,130 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 23 treesize of output 11 [2024-11-11 12:46:01,155 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 23 treesize of output 11 [2024-11-11 12:46:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:01,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:01,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_636) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|)) .cse1))))) is different from false [2024-11-11 12:46:01,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_634 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_634) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_636) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|)) .cse1))))) is different from false [2024-11-11 12:46:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-11 12:46:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099821497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:02,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:02,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 34 [2024-11-11 12:46:02,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542444732] [2024-11-11 12:46:02,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:02,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-11 12:46:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-11 12:46:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=918, Unknown=14, NotChecked=130, Total=1260 [2024-11-11 12:46:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:02,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.857142857142857) internal successors, (170), 35 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:02,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:02,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:46:02,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:46:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 12:46:08,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 12:46:08,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 12:46:08,248 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1927875044, now seen corresponding path program 1 times [2024-11-11 12:46:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635402021] [2024-11-11 12:46:08,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:10,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635402021] [2024-11-11 12:46:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635402021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497852286] [2024-11-11 12:46:10,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:10,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:10,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:10,343 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-11-11 12:46:10,344 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-11-11 12:46:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:10,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-11 12:46:10,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:10,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-11 12:46:10,751 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 23 treesize of output 11 [2024-11-11 12:46:10,789 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 23 treesize of output 11 [2024-11-11 12:46:10,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 12:46:10,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:10,895 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-11-11 12:46:10,959 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 23 treesize of output 11 [2024-11-11 12:46:11,006 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 23 treesize of output 11 [2024-11-11 12:46:11,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 12:46:11,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:11,132 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-11-11 12:46:11,217 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 23 treesize of output 11 [2024-11-11 12:46:11,243 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 23 treesize of output 11 [2024-11-11 12:46:11,282 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 23 treesize of output 11 [2024-11-11 12:46:11,320 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 23 treesize of output 11 [2024-11-11 12:46:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:11,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:11,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1)) 2147483647)) is different from false [2024-11-11 12:46:11,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_741) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse2)) 2147483647))))) is different from false [2024-11-11 12:46:11,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= .cse3 400)))))) is different from false [2024-11-11 12:46:11,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= 400 .cse4)))))) is different from false [2024-11-11 12:46:11,901 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647) (= 400 .cse4))))))) is different from false [2024-11-11 12:46:11,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse0 1))))) (let ((.cse4 (let ((.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse5 (select .cse4 .cse2))) (or (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_741) .cse2 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse2) 2147483647) (= 400 .cse5))))))))) is different from false [2024-11-11 12:46:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-11 12:46:12,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497852286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:12,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 38 [2024-11-11 12:46:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185244844] [2024-11-11 12:46:12,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-11 12:46:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-11 12:46:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=883, Unknown=13, NotChecked=414, Total=1560 [2024-11-11 12:46:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:12,151 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:12,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.410256410256411) internal successors, (172), 39 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:12,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:12,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:46:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 12:46:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:13,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse12 .cse13)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647)) (< .cse2 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_28| Int) (v_ArrVal_741 Int) (v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_26| Int) (v_ArrVal_738 (Array Int Int))) (let ((.cse9 (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_28|)))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse9 .cse1))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_738) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_26|)))) (let ((.cse4 (select .cse6 .cse1))) (or (= 400 .cse3) (= 400 .cse4) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_741) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647))))))) (or (forall ((v_ArrVal_743 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< (select (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse12 .cse13 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_743) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483647)) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|))))) is different from false [2024-11-11 12:46:20,800 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-11-11 12:46:23,095 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-11-11 12:46:25,377 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-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:46:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:46:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:46:27,655 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-11-11 12:46:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 12:46:27,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1231101221, now seen corresponding path program 1 times [2024-11-11 12:46:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229012232] [2024-11-11 12:46:27,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229012232] [2024-11-11 12:46:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229012232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007923196] [2024-11-11 12:46:28,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:28,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:28,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:28,166 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-11-11 12:46:28,167 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-11-11 12:46:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:28,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 12:46:28,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:28,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 12:46:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007923196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 12:46:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-11-11 12:46:28,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030634426] [2024-11-11 12:46:28,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:28,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 12:46:28,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 12:46:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-11 12:46:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:28,623 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:28,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:28,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:46:28,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:46:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 12:46:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 12:46:29,235 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1589456826, now seen corresponding path program 1 times [2024-11-11 12:46:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297739954] [2024-11-11 12:46:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:29,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 12:46:29,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:29,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297739954] [2024-11-11 12:46:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297739954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:29,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 12:46:29,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954429240] [2024-11-11 12:46:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:46:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:46:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:46:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:29,392 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:46:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:46:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:46:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:29,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 12:46:29,653 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:29,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1818006789, now seen corresponding path program 2 times [2024-11-11 12:46:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836973011] [2024-11-11 12:46:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836973011] [2024-11-11 12:46:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836973011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693555522] [2024-11-11 12:46:37,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 12:46:37,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:37,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:37,491 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-11-11 12:46:37,492 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-11-11 12:46:38,435 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 12:46:38,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 12:46:38,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 2274 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-11 12:46:38,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:38,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2024-11-11 12:46:38,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:38,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:38,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-11 12:46:38,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:38,769 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 23 treesize of output 16 [2024-11-11 12:46:38,871 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:38,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:38,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:39,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:39,160 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 23 treesize of output 16 [2024-11-11 12:46:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,399 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:39,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:39,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:39,583 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 23 treesize of output 16 [2024-11-11 12:46:39,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,819 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:39,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:39,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-11 12:46:40,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:40,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 12:46:40,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-11 12:46:40,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-11 12:46:40,490 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 38 treesize of output 28 [2024-11-11 12:46:40,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-11 12:46:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:40,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:41,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) is different from false [2024-11-11 12:46:41,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1))))) is different from false [2024-11-11 12:46:41,147 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)))))) is different from false [2024-11-11 12:46:41,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) is different from false [2024-11-11 12:46:44,791 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< 2147483647 v_ArrVal_1185)))))) is different from false [2024-11-11 12:46:45,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185))))))) is different from false [2024-11-11 12:46:45,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1177) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))))) is different from false [2024-11-11 12:46:54,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< 2147483647 v_ArrVal_1185) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select (store (store (store .cse3 .cse4 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse4) 2147483647) (< (select .cse3 .cse4) (+ v_ArrVal_1189 1)))))))) is different from false [2024-11-11 12:46:55,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1177) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))))) is different from false [2024-11-11 12:46:55,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1169) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse3 .cse4) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse3 .cse4 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse4) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|)))))))) is different from false [2024-11-11 12:47:01,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1166)))) (let ((.cse5 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1169) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse4 (let ((.cse7 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|)))))))) is different from false [2024-11-11 12:47:01,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1166)))) (let ((.cse7 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1169) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse4 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|))))))))) is different from false [2024-11-11 12:47:01,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_36| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1188 (Array Int Int)) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1166 Int) (v_ArrVal_1177 Int) (v_ArrVal_1169 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 v_ArrVal_1166)))) (let ((.cse6 (let ((.cse11 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1167) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_36|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse10 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1169) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_~#stored_elements~0.base| v_ArrVal_1172) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse0 (let ((.cse9 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1177) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1166) (< 2147483647 v_ArrVal_1185) (< (select .cse4 .cse5) (+ v_ArrVal_1189 1)) (< (select (store (store (store .cse4 .cse5 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse5) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|))))))))) is different from false [2024-11-11 12:47:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 78 refuted. 2 times theorem prover too weak. 0 trivial. 28 not checked. [2024-11-11 12:47:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693555522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:47:09,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:47:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 29] total 77 [2024-11-11 12:47:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026742992] [2024-11-11 12:47:09,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:47:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-11 12:47:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:47:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-11 12:47:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=3687, Unknown=59, NotChecked=1820, Total=6162 [2024-11-11 12:47:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:09,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:47:09,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 4.397435897435898) internal successors, (343), 78 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:47:09,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:47:09,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-11 12:47:09,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:09,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:09,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-11 12:47:22,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 12:47:22,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:47:22,246 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:47:22,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:47:22,246 INFO L85 PathProgramCache]: Analyzing trace with hash -700277092, now seen corresponding path program 2 times [2024-11-11 12:47:22,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:47:22,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169676200] [2024-11-11 12:47:22,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:47:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:47:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:47:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:47:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:47:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169676200] [2024-11-11 12:47:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169676200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:47:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35033143] [2024-11-11 12:47:27,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 12:47:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:47:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:47:27,351 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-11-11 12:47:27,352 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-11-11 12:47:28,185 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 12:47:28,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 12:47:28,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-11-11 12:47:28,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:47:28,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-11 12:47:28,284 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 23 treesize of output 11 [2024-11-11 12:47:28,332 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 23 treesize of output 11 [2024-11-11 12:47:28,403 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 23 treesize of output 3 [2024-11-11 12:47:28,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:28,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 12:47:28,502 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:47:28,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-11 12:47:28,546 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 23 treesize of output 11 [2024-11-11 12:47:28,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 12:47:28,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:28,649 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-11-11 12:47:28,734 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 23 treesize of output 11 [2024-11-11 12:47:28,764 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 23 treesize of output 11 [2024-11-11 12:47:28,833 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:47:28,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-11 12:47:28,873 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 23 treesize of output 11 [2024-11-11 12:47:28,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 12:47:28,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:28,973 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-11-11 12:47:29,055 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 23 treesize of output 11 [2024-11-11 12:47:29,089 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 23 treesize of output 11 [2024-11-11 12:47:29,146 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:47:29,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-11 12:47:29,193 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 23 treesize of output 11 [2024-11-11 12:47:29,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-11 12:47:29,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:29,300 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-11-11 12:47:29,387 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 23 treesize of output 11 [2024-11-11 12:47:29,410 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 23 treesize of output 11 [2024-11-11 12:47:29,454 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:47:29,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-11 12:47:29,481 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 23 treesize of output 11 [2024-11-11 12:47:29,485 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-11-11 12:47:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:47:29,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:47:29,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3)) 2147483647)))) is different from false [2024-11-11 12:47:29,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3)) 2147483647)))) is different from false [2024-11-11 12:47:30,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) is different from false [2024-11-11 12:47:30,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) is different from false [2024-11-11 12:47:33,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse2 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647))))))) is different from false [2024-11-11 12:47:33,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))))) is different from false [2024-11-11 12:47:34,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse2 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))))) is different from false [2024-11-11 12:47:34,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1367)))) (let ((.cse0 (let ((.cse9 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (let ((.cse8 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse4 (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1367) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|))))))) is different from false [2024-11-11 12:47:34,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1367)))) (let ((.cse2 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1367) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|)))))))) is different from false [2024-11-11 12:47:34,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1367)))) (let ((.cse8 (let ((.cse11 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse10 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1370) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse9 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1378) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1367) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1387) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse3) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse8 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|)))))))) is different from false [2024-11-11 12:47:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 90 refuted. 9 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-11 12:47:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35033143] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:47:45,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:47:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 29] total 66 [2024-11-11 12:47:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164252785] [2024-11-11 12:47:45,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:47:45,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-11 12:47:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:47:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-11 12:47:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=2537, Unknown=64, NotChecked=1210, Total=4556 [2024-11-11 12:47:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:45,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:47:45,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 5.253731343283582) internal successors, (352), 67 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:45,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-11 12:47:45,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:48:14,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse13 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse13 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse13 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse16 (store .cse11 .cse12 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse14 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse14 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|))))))))) is different from false [2024-11-11 12:48:14,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse19 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse20 (+ (* (select .cse19 .cse2) 4) |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse3 .cse5)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1370) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse10 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse11 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse16 (store .cse19 .cse20 |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (let ((.cse13 (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_1370) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse14 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse16 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse24 (store .cse19 .cse20 |v_t1Thread1of1ForFork0_enqueue_~x#1_48|))) (let ((.cse25 (let ((.cse28 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse24 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_1367)) |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|)))) (let ((.cse23 (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse25 .cse9 v_ArrVal_1370) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse27 (+ (* (select .cse27 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse22 (let ((.cse26 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse23 .cse9 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse23 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse22 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (+ (select .cse24 .cse2) 1) v_ArrVal_1367) (< (select .cse25 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse30 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse31 (let ((.cse32 (select (store .cse30 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse29 (select (store (store .cse30 |c_~#queue~0.base| (store (store .cse31 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse29 (+ (* 4 (select .cse29 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse31 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:48:16,517 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-11-11 12:48:18,530 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-11-11 12:48:20,552 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-11-11 12:48:22,597 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-11-11 12:48:24,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:26,953 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-11-11 12:48:29,305 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-11-11 12:48:32,015 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-11-11 12:48:34,023 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-11-11 12:48:35,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:37,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-11-11 12:48:39,627 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-11-11 12:48:41,642 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-11-11 12:48:43,655 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-11-11 12:48:45,670 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-11-11 12:48:47,681 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-11-11 12:48:49,754 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-11-11 12:48:52,322 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-11-11 12:48:54,333 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-11-11 12:48:56,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-11-11 12:48:58,444 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-11-11 12:49:00,458 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-11-11 12:49:02,469 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-11-11 12:49:04,479 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-11-11 12:49:06,491 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-11-11 12:49:08,500 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-11-11 12:49:10,547 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-11-11 12:49:10,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse12 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse12 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647))))))) is different from false [2024-11-11 12:49:12,447 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse25 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse26 (+ (* (select .cse25 .cse1) 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse10 .cse12)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1374 Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1374) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse2 (let ((.cse6 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1387) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse15 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1370) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse16 (let ((.cse18 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse13 (let ((.cse17 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse16 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) (< .cse8 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse22 (store .cse25 .cse26 |v_t1Thread1of1ForFork0_enqueue_~x#1_46|))) (let ((.cse19 (let ((.cse24 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse22 .cse5 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse20 (let ((.cse23 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse20 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse22 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_46| Int) (v_ArrVal_1368 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_48| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (v_ArrVal_1367 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse30 (store .cse25 .cse26 |v_t1Thread1of1ForFork0_enqueue_~x#1_48|))) (let ((.cse31 (let ((.cse34 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse30 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1367)) |c_~#stored_elements~0.base| v_ArrVal_1368) |c_~#queue~0.base|))) (store .cse34 (+ (* (select .cse34 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_46|)))) (let ((.cse29 (let ((.cse33 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse31 .cse5 v_ArrVal_1370) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))) |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse28 (let ((.cse32 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse29 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse27 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse28 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse29 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse28 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (+ (select .cse30 .cse1) 1) v_ArrVal_1367) (< (select .cse31 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse36 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1378) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse37 (let ((.cse38 (select (store .cse36 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse35 (select (store (store .cse36 |c_~#queue~0.base| (store (store .cse37 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse35 (+ (* 4 (select .cse35 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse37 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:49:14,486 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-11-11 12:49:16,492 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-11-11 12:49:18,502 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-11-11 12:49:20,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:49:22,855 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-11-11 12:49:24,866 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-11-11 12:49:27,179 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-11-11 12:49:29,192 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-11-11 12:49:31,201 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-11-11 12:49:33,209 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-11-11 12:49:35,218 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-11-11 12:49:38,087 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-11-11 12:49:40,096 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-11-11 12:49:42,393 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-11-11 12:49:44,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-11-11 12:49:46,479 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-11-11 12:49:49,525 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-11-11 12:50:07,226 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-11-11 12:50:09,249 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-11-11 12:50:11,265 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-11-11 12:50:13,286 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-11-11 12:50:15,299 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-11-11 12:50:28,455 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-11-11 12:50:36,731 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-11-11 12:50:38,741 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-11-11 12:50:40,762 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-11-11 12:50:42,770 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-11-11 12:50:44,779 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-11-11 12:50:46,800 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-11-11 12:50:48,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:50:50,168 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-11-11 12:50:52,243 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-11-11 12:50:54,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:50:56,269 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-11-11 12:50:58,282 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-11-11 12:51:00,292 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-11-11 12:51:02,298 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-11-11 12:51:04,307 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-11-11 12:51:06,315 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-11-11 12:51:08,324 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-11-11 12:51:10,331 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-11-11 12:51:12,340 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-11-11 12:51:14,346 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-11-11 12:51:16,354 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-11-11 12:51:16,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-11 12:51:18,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:51:20,308 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-11-11 12:51:22,316 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-11-11 12:51:24,351 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-11-11 12:51:26,363 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-11-11 12:51:28,380 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-11-11 12:51:30,390 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-11-11 12:51:32,401 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-11-11 12:51:34,484 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-11-11 12:51:36,497 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-11-11 12:51:38,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:51:40,032 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-11-11 12:51:42,043 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-11-11 12:51:43,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:51:45,109 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-11-11 12:51:47,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:51:51,619 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-11-11 12:51:53,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:51:55,369 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-11-11 12:51:58,332 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-11-11 12:52:00,338 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-11-11 12:52:00,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse10)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1177) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1185) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse11 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse11 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse11 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (let ((.cse12 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1) 2147483647)) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse15 (let ((.cse17 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_34|)))) (let ((.cse14 (let ((.cse16 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse1 v_ArrVal_1177) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse13 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse15 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-11 12:52:02,363 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-11-11 12:52:04,378 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-11-11 12:52:05,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:52:07,848 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-11-11 12:52:10,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:52:12,080 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-11-11 12:52:14,095 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-11-11 12:52:16,103 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-11-11 12:52:18,358 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-11-11 12:52:20,565 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-11-11 12:52:22,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-11-11 12:52:25,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:52:31,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse10 .cse12)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647)) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1177) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse3 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse3 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< (select .cse3 .cse2) (+ v_ArrVal_1189 1)) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< 2147483647 v_ArrVal_1185) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1185) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse13 .cse2) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse13 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse13 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_34| Int) (v_ArrVal_1189 Int) (v_ArrVal_1177 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse16 (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_34|))) (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse2 v_ArrVal_1177) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse2 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse14 .cse2) (+ v_ArrVal_1189 1)) (< (select .cse15 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse14 .cse2 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< 2147483647 v_ArrVal_1185) (< (select .cse16 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-11 12:52:32,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse3 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1370 Int) (v_ArrVal_1387 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1370) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse10 (let ((.cse12 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse11 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse15 (let ((.cse16 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse15 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:52:32,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse8 .cse9)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_73|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< .cse4 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse10 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse10 .cse1) (+ v_ArrVal_1189 1)))))))) is different from false [2024-11-11 12:52:32,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| Int) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95| 1))))) (let ((.cse1 (let ((.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse3 (let ((.cse7 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse6 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_95|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647)))))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse12 (let ((.cse15 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647)))))))) is different from false [2024-11-11 12:52:32,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse2 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1180) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1185) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< 2147483647 v_ArrVal_1185))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse7 .cse1 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse7 .cse1) (+ v_ArrVal_1189 1))))))) is different from false [2024-11-11 12:52:32,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse4 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse9 (let ((.cse11 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse7 (let ((.cse10 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))))) is different from false [2024-11-11 12:52:38,906 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (v_ArrVal_1373 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1373) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse6 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))) is different from false [2024-11-11 12:53:03,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse0 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1189 1)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse6 .cse1) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse6 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse6 .cse7)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse9 (store .cse0 .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1185) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse8 .cse1 v_ArrVal_1189) .cse2 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse7) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse1) 2147483647) (< (select .cse8 .cse1) (+ v_ArrVal_1189 1)) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))))) is different from false [2024-11-11 12:53:03,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse3 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse9 (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse7 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_1378) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|))))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse14 (let ((.cse15 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse8 v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:53:06,721 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-11-11 12:53:08,765 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-11-11 12:53:11,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:53:13,127 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-11-11 12:53:15,139 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-11-11 12:53:17,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 [1] [2024-11-11 12:53:19,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:53:21,753 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-11-11 12:53:23,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-11-11 12:53:25,787 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-11-11 12:53:28,108 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-11-11 12:53:30,118 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-11-11 12:53:32,974 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-11-11 12:53:34,999 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-11-11 12:53:37,010 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-11-11 12:53:39,018 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-11-11 12:53:41,026 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-11-11 12:53:43,493 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-11-11 12:53:45,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:53:47,306 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-11-11 12:53:49,315 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-11-11 12:53:51,324 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-11-11 12:53:53,369 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-11-11 12:53:55,378 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-11-11 12:53:55,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1189 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< |c_t2Thread1of1ForFork1_dequeue_#t~post45#1| (+ v_ArrVal_1189 1)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1189) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse2) 2147483647))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse5 .cse2) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse5 .cse2 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647))))))) is different from false [2024-11-11 12:53:57,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:53:57,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse10 .cse12)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1374 Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse4 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1374) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_44|)))) (let ((.cse2 (let ((.cse6 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1378) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))) |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1387) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647))) (< .cse8 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1378) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse15 (let ((.cse16 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse5 v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:53:59,684 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-11-11 12:54:02,604 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-11-11 12:54:04,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 [1] [2024-11-11 12:54:07,704 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-11-11 12:54:09,739 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-11-11 12:54:11,747 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-11-11 12:54:13,784 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-11-11 12:54:15,798 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-11-11 12:54:18,126 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-11-11 12:54:20,135 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-11-11 12:54:22,329 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-11-11 12:54:24,341 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-11-11 12:54:26,436 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-11-11 12:54:28,450 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-11-11 12:54:31,253 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-11-11 12:54:33,379 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-11-11 12:54:35,385 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-11-11 12:54:37,402 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-11-11 12:54:39,412 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-11-11 12:55:08,407 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-11-11 12:55:10,419 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-11-11 12:55:12,425 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-11-11 12:55:14,441 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-11-11 12:55:16,449 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-11-11 12:55:35,693 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-11-11 12:55:37,704 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-11-11 12:55:39,712 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-11-11 12:55:41,725 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-11-11 12:55:43,748 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-11-11 12:55:45,921 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-11-11 12:55:47,930 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-11-11 12:55:49,939 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-11-11 12:55:51,953 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-11-11 12:55:54,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-11-11 12:55:56,142 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-11-11 12:55:58,246 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-11-11 12:56:00,871 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-11-11 12:56:02,878 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-11-11 12:56:04,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:56:06,959 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-11-11 12:56:08,966 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-11-11 12:56:10,974 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-11-11 12:56:12,987 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-11-11 12:56:13,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse7 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_1185) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse6 .cse3 v_ArrVal_1189) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse6 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647) (< (select .cse6 .cse3) (+ v_ArrVal_1189 1)) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646))) is different from false [2024-11-11 12:56:15,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-11-11 12:56:17,034 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-11-11 12:56:19,045 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-11-11 12:56:21,057 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-11-11 12:56:23,064 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-11-11 12:56:25,071 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-11-11 12:56:27,090 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-11-11 12:56:29,129 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-11-11 12:56:31,140 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-11-11 12:56:33,147 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-11-11 12:56:35,938 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-11-11 12:56:39,206 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-11-11 12:56:41,216 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-11-11 12:56:43,503 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-11-11 12:56:45,512 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-11-11 12:56:47,523 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-11-11 12:56:49,737 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-11-11 12:56:51,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:56:53,117 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-11-11 12:56:55,124 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-11-11 12:56:57,361 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-11-11 12:57:01,431 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-11-11 12:57:12,916 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-11-11 12:57:16,209 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-11-11 12:57:18,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-11-11 12:57:20,465 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-11-11 12:57:22,856 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-11-11 12:57:25,031 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-11-11 12:57:27,036 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-11-11 12:57:29,069 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-11-11 12:57:31,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-11-11 12:57:33,083 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-11-11 12:57:33,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (let ((.cse5 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse3) 2147483647)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646))) is different from false [2024-11-11 12:57:34,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:57:36,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:57:38,436 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-11-11 12:57:40,467 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-11-11 12:57:42,773 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-11-11 12:57:45,038 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-11-11 12:57:47,048 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-11-11 12:57:49,422 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-11-11 12:57:53,716 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-11-11 12:57:55,742 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-11-11 12:57:59,582 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-11-11 12:58:08,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse7) 4) |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647)) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse5 .cse2) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse5 .cse2 v_ArrVal_1189) .cse6 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse5 .cse7)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse9 (store .cse0 .cse1 |v_t1Thread1of1ForFork0_enqueue_~x#1_32|))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1185) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse8 .cse2 v_ArrVal_1189) .cse6 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse8 .cse7) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse2) 2147483647) (< (select .cse8 .cse2) (+ v_ArrVal_1189 1)) (< (select .cse9 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2024-11-11 12:58:08,377 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1185 Int) (v_ArrVal_1189 Int) (v_ArrVal_1188 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1185) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_1188) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select .cse2 .cse3) (+ v_ArrVal_1189 1)) (< 2147483647 v_ArrVal_1185) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1189) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|) .cse3) 2147483647))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-11-11 12:58:08,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1387) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1378 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1378) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse8 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|)))))))) is different from false [2024-11-11 12:58:08,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92| 1))))) (let ((.cse5 (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_92|) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647)))))))) is different from false [2024-11-11 12:58:08,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (v_ArrVal_1381 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1381) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse4 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1) 2147483647)))))) is different from false [2024-11-11 12:58:11,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|))))))) is different from false [2024-11-11 12:58:11,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647))) (< .cse0 2147483647) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1383 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_42| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (let ((.cse6 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1383) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_42|)))) (or (< (select (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1387) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|)))))))) is different from false [2024-11-11 12:58:12,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1387) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-11-11 12:58:12,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (and (< .cse0 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| Int) (v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_89| 1))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse2)) 2147483647)))))) is different from false [2024-11-11 12:58:12,763 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1389 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_40| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1389) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_40|)) .cse1)) 2147483647))) is different from false [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-11 12:58:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-11 12:58:13,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-11 12:58:13,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:58:13,395 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:58:13,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:58:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1730632821, now seen corresponding path program 3 times [2024-11-11 12:58:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:58:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018690152] [2024-11-11 12:58:13,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:58:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:58:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:58:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:58:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:58:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018690152] [2024-11-11 12:58:28,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018690152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:58:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81558183] [2024-11-11 12:58:28,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 12:58:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:58:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:58:28,563 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-11-11 12:58:28,564 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-11-11 12:58:30,157 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 12:58:30,157 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 12:58:30,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-11 12:58:30,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:58:31,051 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 26 treesize of output 14 [2024-11-11 12:58:31,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:58:31,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-11 12:58:31,194 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 24 treesize of output 12 [2024-11-11 12:58:31,227 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 24 treesize of output 12 [2024-11-11 12:58:31,297 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 12:58:31,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 30 [2024-11-11 12:58:31,376 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 24 treesize of output 12 [2024-11-11 12:58:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-11 12:58:31,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:58:31,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 24 treesize of output 17 [2024-11-11 12:58:31,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-11-11 12:58:31,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-11-11 12:58:31,944 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 32 treesize of output 24 [2024-11-11 12:58:31,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2024-11-11 12:58:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 196 proven. 156 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-11 12:58:31,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:58:32,424 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1731 Int) (v_ArrVal_1729 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_50| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1729) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1731 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1731) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_50|) .cse1) 2147483647)))) is different from false [2024-11-11 12:58:32,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1731 Int) (v_ArrVal_1729 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_50| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1729) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1731) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_50|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1731 1))))) is different from false [2024-11-11 12:58:32,452 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1727 Int) (|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1731 Int) (v_ArrVal_1729 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_50| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1727) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1729) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1727) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1731) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_50|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1731 1))))) is different from false [2024-11-11 12:58:34,330 INFO L349 Elim1Store]: treesize reduction 323, result has 42.5 percent of original size [2024-11-11 12:58:34,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 776 treesize of output 443 [2024-11-11 12:58:34,395 INFO L349 Elim1Store]: treesize reduction 40, result has 16.7 percent of original size [2024-11-11 12:58:34,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 503 treesize of output 485 [2024-11-11 12:58:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 187 [2024-11-11 12:58:34,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-11 12:58:34,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:58:34,822 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 281 treesize of output 281 [2024-11-11 12:58:34,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-11 12:58:34,866 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 57 treesize of output 45 [2024-11-11 12:58:34,922 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 12:58:34,923 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 261 treesize of output 261 [2024-11-11 12:58:34,959 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 57 treesize of output 45 [2024-11-11 12:58:35,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:58:35,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:58:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 581 treesize of output 567 [2024-11-11 12:58:35,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:58:35,565 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 1142 treesize of output 1026 [2024-11-11 12:58:38,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:58:38,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 769 treesize of output 531 [2024-11-11 12:58:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 164 proven. 156 refuted. 0 times theorem prover too weak. 320 trivial. 32 not checked. [2024-11-11 12:58:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81558183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:58:38,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:58:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 15, 16] total 66 [2024-11-11 12:58:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826660971] [2024-11-11 12:58:38,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:58:38,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-11 12:58:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:58:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-11 12:58:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=3673, Unknown=8, NotChecked=384, Total=4556 [2024-11-11 12:58:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:58:38,681 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:58:38,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.791044776119403) internal successors, (455), 67 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-11 12:58:38,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:58:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:58:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-11 12:58:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-11 12:58:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-11 12:58:48,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-11 12:58:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-11 12:58:48,477 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:58:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:58:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1974033176, now seen corresponding path program 3 times [2024-11-11 12:58:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:58:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588755119] [2024-11-11 12:58:48,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:58:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms Killed by 15