/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 11:10:19,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 11:10:19,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 11:10:19,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 11:10:19,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 11:10:19,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 11:10:19,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 11:10:19,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 11:10:19,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 11:10:19,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 11:10:19,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 11:10:19,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 11:10:19,101 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 11:10:19,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 11:10:19,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 11:10:19,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 11:10:19,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 11:10:19,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 11:10:19,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 11:10:19,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 11:10:19,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 11:10:19,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 11:10:19,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 11:10:19,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 11:10:19,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 11:10:19,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 11:10:19,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 11:10:19,105 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 11:10:19,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 11:10:19,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 11:10:19,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 11:10:19,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 11:10:19,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 11:10:19,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 11:10:19,107 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 11:10:19,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 11:10:19,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 11:10:19,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 11:10:19,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 11:10:19,107 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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-05-03 11:10:19,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 11:10:19,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 11:10:19,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 11:10:19,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 11:10:19,323 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 11:10:19,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-05-03 11:10:20,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 11:10:20,512 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 11:10:20,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2024-05-03 11:10:20,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61cd42f52/0a837478eb1e4b838d2bec5bcc8f3af3/FLAGa089ce06c [2024-05-03 11:10:20,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61cd42f52/0a837478eb1e4b838d2bec5bcc8f3af3 [2024-05-03 11:10:20,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 11:10:20,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 11:10:20,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 11:10:20,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 11:10:20,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 11:10:20,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a2c59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20, skipping insertion in model container [2024-05-03 11:10:20,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,568 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 11:10:20,691 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2024-05-03 11:10:20,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 11:10:20,705 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 11:10:20,721 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2024-05-03 11:10:20,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 11:10:20,735 INFO L206 MainTranslator]: Completed translation [2024-05-03 11:10:20,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20 WrapperNode [2024-05-03 11:10:20,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 11:10:20,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 11:10:20,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 11:10:20,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 11:10:20,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,769 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 196 [2024-05-03 11:10:20,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 11:10:20,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 11:10:20,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 11:10:20,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 11:10:20,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 11:10:20,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 11:10:20,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 11:10:20,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 11:10:20,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (1/1) ... [2024-05-03 11:10:20,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 11:10:20,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:20,842 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-05-03 11:10:20,852 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-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-05-03 11:10:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 11:10:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 11:10:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 11:10:20,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 11:10:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 11:10:20,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 11:10:20,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 11:10:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 11:10:20,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 11:10:20,900 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 11:10:21,019 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 11:10:21,021 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 11:10:21,408 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 11:10:21,420 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 11:10:21,420 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-05-03 11:10:21,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 11:10:21 BoogieIcfgContainer [2024-05-03 11:10:21,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 11:10:21,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 11:10:21,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 11:10:21,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 11:10:21,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 11:10:20" (1/3) ... [2024-05-03 11:10:21,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726b34cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 11:10:21, skipping insertion in model container [2024-05-03 11:10:21,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:10:20" (2/3) ... [2024-05-03 11:10:21,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726b34cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 11:10:21, skipping insertion in model container [2024-05-03 11:10:21,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 11:10:21" (3/3) ... [2024-05-03 11:10:21,427 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2024-05-03 11:10:21,433 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 11:10:21,440 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 11:10:21,441 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 11:10:21,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 11:10:21,490 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 11:10:21,537 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 11:10:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 11:10:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:21,539 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-05-03 11:10:21,539 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-05-03 11:10:21,571 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 11:10:21,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 11:10:21,582 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@334617e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 11:10:21,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 11:10:21,772 INFO L78 Accepts]: Start accepts. Automaton has currently 387 states, but on-demand construction may add more states Word has length 178 [2024-05-03 11:10:21,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:21,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:21,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 626981254, now seen corresponding path program 1 times [2024-05-03 11:10:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947936702] [2024-05-03 11:10:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:21,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947936702] [2024-05-03 11:10:21,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-05-03 11:10:21,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103541799] [2024-05-03 11:10:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:21,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:21,966 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-05-03 11:10:21,967 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-05-03 11:10:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:22,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjunts are in the unsatisfiable core [2024-05-03 11:10:22,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:22,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-03 11:10:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103541799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:10:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:10:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 11:10:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641369265] [2024-05-03 11:10:22,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:22,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 11:10:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:22,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 11:10:22,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 11:10:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:22,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 11:10:22,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,215 INFO L78 Accepts]: Start accepts. Automaton has currently 387 states, but on-demand construction may add more states Word has length 168 [2024-05-03 11:10:22,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:22,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-03 11:10:22,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-05-03 11:10:22,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:22,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -327476268, now seen corresponding path program 1 times [2024-05-03 11:10:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226113757] [2024-05-03 11:10:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:22,453 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240724446] [2024-05-03 11:10:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:22,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:22,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:22,455 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-05-03 11:10:22,457 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-05-03 11:10:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:22,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-03 11:10:22,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:22,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-03 11:10:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226113757] [2024-05-03 11:10:22,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240724446] [2024-05-03 11:10:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240724446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:10:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:10:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 11:10:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961874785] [2024-05-03 11:10:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:22,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 11:10:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 11:10:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 11:10:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,773 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-05-03 11:10:22,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:22,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:22,951 INFO L78 Accepts]: Start accepts. Automaton has currently 428 states, but on-demand construction may add more states Word has length 200 [2024-05-03 11:10:22,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:22,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 11:10:23,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:23,159 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:23,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1971730840, now seen corresponding path program 1 times [2024-05-03 11:10:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123597072] [2024-05-03 11:10:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:23,197 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845942006] [2024-05-03 11:10:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:23,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:23,200 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-05-03 11:10:23,226 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-05-03 11:10:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:23,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-03 11:10:23,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:23,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:10:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123597072] [2024-05-03 11:10:23,483 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845942006] [2024-05-03 11:10:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845942006] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:10:23,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:10:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-05-03 11:10:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474959582] [2024-05-03 11:10:23,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:10:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 11:10:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 11:10:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 11:10:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:23,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:23,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 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-05-03 11:10:23,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:23,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:23,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:23,570 INFO L78 Accepts]: Start accepts. Automaton has currently 526 states, but on-demand construction may add more states Word has length 207 [2024-05-03 11:10:23,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:23,576 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-05-03 11:10:23,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:23,776 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:23,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash 154478364, now seen corresponding path program 1 times [2024-05-03 11:10:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060379739] [2024-05-03 11:10:23,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:23,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:23,807 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396322035] [2024-05-03 11:10:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:23,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:23,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:23,809 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-05-03 11:10:23,814 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-05-03 11:10:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:23,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-03 11:10:23,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 11:10:24,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-03 11:10:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060379739] [2024-05-03 11:10:24,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396322035] [2024-05-03 11:10:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396322035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:10:24,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:10:24,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 11:10:24,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232557941] [2024-05-03 11:10:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:24,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 11:10:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:24,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 11:10:24,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-03 11:10:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.875) internal successors, (207), 8 states have internal predecessors, (207), 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-05-03 11:10:24,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:24,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:24,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:24,442 INFO L78 Accepts]: Start accepts. Automaton has currently 2415 states, but on-demand construction may add more states Word has length 215 [2024-05-03 11:10:24,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:24,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-03 11:10:24,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:24,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:24,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1031581341, now seen corresponding path program 1 times [2024-05-03 11:10:24,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:24,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414313136] [2024-05-03 11:10:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:24,684 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831309057] [2024-05-03 11:10:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:24,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:24,686 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-05-03 11:10:24,689 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-05-03 11:10:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:24,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 11:10:24,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:24,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:10:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 11:10:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414313136] [2024-05-03 11:10:24,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831309057] [2024-05-03 11:10:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831309057] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 11:10:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-03 11:10:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-05-03 11:10:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186146057] [2024-05-03 11:10:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 11:10:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 11:10:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-03 11:10:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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-05-03 11:10:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:25,153 INFO L78 Accepts]: Start accepts. Automaton has currently 2531 states, but on-demand construction may add more states Word has length 224 [2024-05-03 11:10:25,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:25,163 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-05-03 11:10:25,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:25,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:25,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1813709585, now seen corresponding path program 1 times [2024-05-03 11:10:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451141965] [2024-05-03 11:10:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:25,391 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967391201] [2024-05-03 11:10:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:25,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:25,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:25,395 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-05-03 11:10:25,429 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-05-03 11:10:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:25,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-03 11:10:25,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:10:25,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-03 11:10:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451141965] [2024-05-03 11:10:25,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967391201] [2024-05-03 11:10:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967391201] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:10:25,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:10:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-03 11:10:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760841860] [2024-05-03 11:10:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-03 11:10:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-03 11:10:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-05-03 11:10:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:25,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:25,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.666666666666668) internal successors, (224), 12 states have internal predecessors, (224), 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-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:25,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:10:26,278 INFO L78 Accepts]: Start accepts. Automaton has currently 2547 states, but on-demand construction may add more states Word has length 240 [2024-05-03 11:10:26,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:26,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-03 11:10:26,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-03 11:10:26,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:26,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 698309975, now seen corresponding path program 1 times [2024-05-03 11:10:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586908757] [2024-05-03 11:10:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:26,529 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344002067] [2024-05-03 11:10:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:26,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:26,542 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-05-03 11:10:26,568 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-05-03 11:10:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:26,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 11:10:26,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-03 11:10:26,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:10:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-03 11:10:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:10:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586908757] [2024-05-03 11:10:26,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:10:26,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344002067] [2024-05-03 11:10:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344002067] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 11:10:26,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-03 11:10:26,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2024-05-03 11:10:26,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174302511] [2024-05-03 11:10:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:10:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 11:10:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:10:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 11:10:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-05-03 11:10:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:26,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:10:26,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:10:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:10:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:10:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:10:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:10:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:10:27,126 INFO L78 Accepts]: Start accepts. Automaton has currently 2495 states, but on-demand construction may add more states Word has length 247 [2024-05-03 11:10:27,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:10:27,136 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-05-03 11:10:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:27,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:10:27,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:10:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 675644443, now seen corresponding path program 1 times [2024-05-03 11:10:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:10:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475013651] [2024-05-03 11:10:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:10:27,359 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:10:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645484886] [2024-05-03 11:10:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:10:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:10:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:10:27,360 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-05-03 11:10:27,382 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-05-03 11:10:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:10:27,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 134 conjunts are in the unsatisfiable core [2024-05-03 11:10:27,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:10:27,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-03 11:10:28,296 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-05-03 11:10:28,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-05-03 11:10:28,641 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-03 11:10:28,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-05-03 11:10:29,248 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-05-03 11:10:29,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-05-03 11:10:29,955 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 15 treesize of output 1 [2024-05-03 11:10:30,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:10:30,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-03 11:10:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:10:30,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-03 11:10:30,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-05-03 11:10:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-03 11:10:31,334 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-03 11:10:31,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2024-05-03 11:10:31,352 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-05-03 11:10:31,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2024-05-03 11:10:31,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2024-05-03 11:10:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2024-05-03 11:10:32,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-05-03 11:10:32,460 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-03 11:10:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2024-05-03 11:10:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 11:10:32,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:10:33,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:10:33,590 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 322 treesize of output 290 [2024-05-03 11:10:33,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 137 [2024-05-03 11:11:04,701 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-03 11:11:04,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3372 treesize of output 2806 [2024-05-03 11:11:07,567 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-03 11:11:07,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2320 treesize of output 1754 [2024-05-03 11:11:09,911 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-05-03 11:11:09,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9411 treesize of output 7835 [2024-05-03 11:11:30,263 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-03 11:11:30,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4602 treesize of output 3836 [2024-05-03 11:11:34,569 INFO L349 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2024-05-03 11:11:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3308 treesize of output 2542 [2024-05-03 11:11:37,277 INFO L349 Elim1Store]: treesize reduction 8, result has 97.2 percent of original size [2024-05-03 11:11:37,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5727 treesize of output 4615 [2024-05-03 11:11:48,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse8 (< c_~N~0 1)) (.cse7 (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse3 (< c_~N~0 2)) (.cse18 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse26 (+ c_~F~0.offset .cse66)) (.cse2 (= c_~F~0.base c_~A~0.base)) (.cse20 (= (+ c_~A~0.offset .cse66) c_~F~0.offset)) (.cse19 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse12 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse59 (* 4 c_~M~0)) (.cse56 (+ 5 c_~F~0.offset)) (.cse1 (< c_~M~0 1))) (and (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (= c_~F~0.base (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (store .cse0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) v_ArrVal_603)) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse1 .cse2) (or .cse3 .cse1) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse5 (select (select .cse6 c_~B~0.base) c_~B~0.offset))) (let ((.cse4 (select (select (store .cse6 .cse5 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse4 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse4 .cse5))))))) (or .cse7 .cse1 .cse8) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse10 (select (select .cse11 c_~B~0.base) c_~B~0.offset))) (let ((.cse9 (select (select (store .cse11 .cse10 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse9) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse9 .cse10))))))) (or .cse1 .cse12 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse13 (select (select .cse15 c_~B~0.base) c_~B~0.offset))) (let ((.cse14 (select (select (store .cse15 .cse13 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse13) (< ~a~0 0) (not (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0)) (= .cse14 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse14 .cse13))))))) (or .cse8 (< c_~M~0 2)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse16 .cse17 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse17))))) .cse1) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) .cse18) (< c_~N~0 (+ ~a~0 1)))) .cse19 .cse1 .cse2) (or .cse1 .cse12 (and (or .cse8 .cse2) (or .cse20 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 .cse12 (and (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse21 (select (select .cse22 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse21)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse22 .cse21 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse2 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse25 (* ~a~0 c_~M~0))) (or (not (let ((.cse23 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse24 (select (select .cse23 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse23 .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse24)))) (< ~a~0 0) (not (= .cse25 c_thread1Thread1of1ForFork0_~i~0)) (= (+ c_~A~0.offset (* .cse25 4)) .cse26) (< c_~N~0 (+ ~a~0 1)))))) (or (and .cse20 .cse2) (and (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse28 (select (select .cse30 c_~B~0.base) c_~B~0.offset))) (let ((.cse29 (* ~a~0 c_~M~0)) (.cse27 (select (select (store .cse30 .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse27 .cse28)) (< ~a~0 0) (not (= .cse29 c_thread1Thread1of1ForFork0_~i~0)) (= (+ c_~A~0.offset (* .cse29 4)) .cse26) (= .cse27 c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) .cse2) (forall ((~a~0 Int)) (let ((.cse31 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse31 .cse26) (= c_~F~0.offset .cse31) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse32)) (= (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)))))))))) (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse34 (select (select (store .cse36 .cse35 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse34 .cse35)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse34 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse20 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse37 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse38 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse37 .cse38 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse38)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or .cse19 .cse3 .cse1) (or .cse7 .cse3 .cse1) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse40 (select (select .cse41 c_~B~0.base) c_~B~0.offset))) (let ((.cse39 (select (select (store .cse41 .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse39 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse39 .cse40) (= c_~B~0.base .cse40)))))) .cse1) (or (forall ((~a~0 Int)) (let ((.cse42 (* ~a~0 c_~M~0))) (let ((.cse43 (+ c_~A~0.offset (* .cse42 4)))) (or (= .cse42 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse43 .cse26) (= c_~F~0.offset .cse43) (< c_~N~0 (+ ~a~0 1)))))) .cse1) (or .cse1 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse45 (select (select .cse44 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= (select (select (store .cse44 .cse45 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse45) (= c_~B~0.base .cse45)))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse46 (select (select .cse47 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base .cse46) (< ~a~0 0) (not (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0)) (< c_~N~0 (+ ~a~0 1)) (= (select (select (store .cse47 .cse46 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse46))))) .cse1 .cse12) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse49 (select (select .cse50 c_~B~0.base) c_~B~0.offset))) (let ((.cse48 (select (select (store .cse50 .cse49 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse48) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse48 .cse49) (= c_~B~0.base .cse49)))))) .cse1) (or .cse19 (let ((.cse63 (* c_~A~0.offset (- 1)))) (let ((.cse54 (div (+ .cse63 c_~F~0.offset) 4)) (.cse57 (+ 5 c_~F~0.offset .cse66))) (and (or .cse1 (forall ((~a~0 Int)) (let ((.cse51 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse51 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse51 1)))))) (forall ((~a~0 Int)) (let ((.cse52 (* ~a~0 c_~M~0))) (let ((.cse53 (+ .cse52 c_~M~0))) (or (< ~a~0 0) (< .cse26 (+ c_~A~0.offset (* .cse52 4) 1)) (< .cse53 .cse18) (< c_~N~0 (+ ~a~0 1)) (< .cse53 (+ 2 .cse54)))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse58 (* ~a~0 c_~M~0))) (let ((.cse55 (+ c_~A~0.offset (* .cse58 4) .cse59))) (or (< ~a~0 0) (< .cse55 .cse56) (< .cse55 .cse57) (< (+ .cse58 c_~M~0) .cse18) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse61 (* ~a~0 c_~M~0))) (let ((.cse60 (+ c_~A~0.offset (* .cse61 4) 1))) (or (< ~a~0 0) (< .cse26 .cse60) (< (+ .cse61 c_~M~0) .cse18) (< c_~F~0.offset .cse60) (< c_~N~0 (+ ~a~0 1))))))) (or .cse1 (forall ((~a~0 Int)) (let ((.cse62 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse62 4) .cse59) .cse56) (< (+ (div (+ (- 1) .cse63 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse62) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse62 1)))))) (or (forall ((~a~0 Int)) (let ((.cse64 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse64 c_~M~0) (+ 2 .cse54 c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse64 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse1) (or (forall ((~a~0 Int)) (let ((.cse65 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse65 4) .cse59) .cse57) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse65 1))))) .cse1))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse68 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse67 (select (select .cse69 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse67)) (< ~a~0 0) (= .cse68 .cse26) (= c_~F~0.offset .cse68) (= (select (select (store .cse69 .cse67 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse1) (or (forall ((~a~0 Int)) (or (= (* ~a~0 c_~M~0) c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse1 .cse2) (or .cse20 .cse19 .cse12 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse59) .cse56) (< c_~N~0 (+ ~a~0 1)))) .cse1) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse1)))))) is different from false [2024-05-03 11:11:57,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:11:57,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2024-05-03 11:11:57,217 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-03 11:11:57,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18732 treesize of output 18020 [2024-05-03 11:11:57,275 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 316 treesize of output 268 [2024-05-03 11:11:57,287 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-03 11:11:57,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 384 treesize of output 364 [2024-05-03 11:11:57,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:11:57,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 229 [2024-05-03 11:11:57,326 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-03 11:11:57,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 304 [2024-05-03 11:11:57,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:11:57,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 98 [2024-05-03 11:11:57,449 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-03 11:11:57,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26779 treesize of output 25739 [2024-05-03 11:11:57,517 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 651 treesize of output 555 [2024-05-03 11:11:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:11:57,530 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 207 [2024-05-03 11:11:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:11:57,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 171 [2024-05-03 11:11:57,556 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-03 11:11:57,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 201 [2024-05-03 11:11:57,802 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-03 11:11:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2024-05-03 11:11:57,809 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-03 11:11:57,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 1 [2024-05-03 11:11:57,815 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-03 11:11:57,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2024-05-03 11:12:05,225 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-03 11:12:05,225 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 22 treesize of output 18 [2024-05-03 11:12:05,231 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-03 11:12:05,231 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 22 treesize of output 18 [2024-05-03 11:12:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 11:12:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:12:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475013651] [2024-05-03 11:12:06,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:12:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645484886] [2024-05-03 11:12:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645484886] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:12:06,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:12:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 53] total 107 [2024-05-03 11:12:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711981902] [2024-05-03 11:12:06,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:12:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-05-03 11:12:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:12:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-05-03 11:12:06,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=10460, Unknown=94, NotChecked=208, Total=11342 [2024-05-03 11:12:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:06,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:12:06,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 4.373831775700935) internal successors, (468), 107 states have internal predecessors, (468), 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-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:06,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:06,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:08,672 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse79 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse40 (select .cse79 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse77 (select |c_#memory_int| c_~A~0.base)) (.cse162 (+ c_~A~0.offset .cse13)) (.cse24 (select .cse79 c_~B~0.offset))) (let ((.cse103 (= c_~B~0.base .cse24)) (.cse163 (select |c_#memory_int| c_~F~0.base)) (.cse164 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse95 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse18 (store |c_#memory_int| c_~A~0.base (store .cse77 .cse162 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse55 (= .cse40 c_~B~0.base))) (let ((.cse48 (not .cse55)) (.cse19 (select (select .cse18 c_~F~0.base) c_~F~0.offset)) (.cse107 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse108 (+ .cse95 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse96 (select .cse163 (+ .cse95 .cse164 c_~F~0.offset))) (.cse41 (select |c_#memory_int| .cse40)) (.cse42 (select .cse163 (+ .cse164 c_~F~0.offset))) (.cse45 (not .cse103)) (.cse7 (+ c_~F~0.offset .cse13)) (.cse30 (< c_~N~0 1)) (.cse25 (select |c_#memory_int| .cse24)) (.cse26 (select .cse163 c_~F~0.offset)) (.cse74 (= .cse162 c_~F~0.offset)) (.cse0 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse73 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse2 (* 4 c_~M~0)) (.cse3 (+ 5 c_~F~0.offset)) (.cse5 (< c_~M~0 1))) (and (or .cse0 (let ((.cse4 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse10 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse1 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse1 4) .cse2) .cse3) (< (+ .cse1 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse6 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse6 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse6 1)))))) (or (forall ((~a~0 Int)) (let ((.cse8 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse7 (+ c_~A~0.offset (* .cse8 4) 1)) (< (+ .cse8 c_~M~0) .cse4) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or .cse5 (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse9 4) .cse2) .cse3) (< (+ (div (+ (- 1) .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse9) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse11 c_~M~0) (+ 2 (div (+ .cse10 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse11 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse5) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse12 4) .cse2) (+ 5 c_~F~0.offset .cse13)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse12 1))))) .cse5)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse14 (store .cse18 .cse17 (store (select .cse18 .cse17) v_arrayElimCell_22 .cse19))) (.cse15 (* ~b~0 4))) (= (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse15)) (select (select .cse14 (select (select (store .cse16 .cse17 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse15 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse17)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse23 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse21 (* ~b~0 4))) (let ((.cse22 (select (select .cse23 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse21))) (.cse20 (select .cse23 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse20 (+ .cse21 v_arrayElimCell_23)) .cse22) (= .cse22 (select .cse20 (+ .cse21 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse5) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse28 (select (select .cse29 c_~B~0.base) c_~B~0.offset))) (let ((.cse27 (select (select (store .cse29 .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse27 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse27 .cse28))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (let ((.cse31 (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse31) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse31 .cse32))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse34 (select (select .cse35 c_~B~0.base) c_~B~0.offset))) (= .cse34 (select (select (store .cse35 .cse34 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse39 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse37 (* ~b~0 4))) (let ((.cse38 (select (select .cse39 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse37))) (.cse36 (select .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse36 (+ .cse37 v_arrayElimCell_23)) .cse38) (= .cse38 (select .cse36 (+ .cse37 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse43 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse44 (* ~b~0 4))) (= (select (select .cse43 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse44 v_arrayElimCell_23)) (select (select .cse43 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse44)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or .cse30 (< c_~M~0 2)) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse46 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse47 (* ~b~0 4))) (= (select (select .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse47 v_arrayElimCell_23)) (select (select .cse46 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse47)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse49 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse50 (select (select .cse49 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse49 .cse50 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse50))))) .cse5) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse52 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse51 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (= .cse51 (select (select (store .cse52 .cse51 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse53 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse54 (* ~b~0 4))) (= (select (select .cse53 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse54 v_arrayElimCell_22)) (select (select .cse53 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse54)))))) .cse55) (or .cse48 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse56 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42))) (.cse57 (* ~b~0 4))) (= (select (select .cse56 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse57 v_arrayElimCell_23)) (select (select .cse56 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse57)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse59 (select (select .cse60 c_~B~0.base) c_~B~0.offset))) (let ((.cse58 (select (select (store .cse60 .cse59 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse58) (< c_~N~0 (+ ~a~0 1)) (= .cse59 .cse58)))))) .cse5) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse65 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (let ((.cse64 (store .cse18 .cse66 (store (select .cse18 .cse66) v_arrayElimCell_21 .cse19))) (.cse63 (* ~b~0 4))) (let ((.cse61 (select (select .cse64 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse63))) (.cse62 (select .cse64 (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_22))) (= .cse61 (select .cse62 (+ .cse63 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse5 .cse30) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse71 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset))) (let ((.cse70 (store .cse18 .cse72 (store (select .cse18 .cse72) v_arrayElimCell_22 .cse19))) (.cse69 (* ~b~0 4))) (let ((.cse67 (select (select .cse70 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse69))) (.cse68 (select .cse70 (select (select (store .cse71 .cse72 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_22))) (= .cse67 (select .cse68 (+ .cse69 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse5 .cse73 (and (or .cse30 (= c_~F~0.base c_~A~0.base)) (or .cse74 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse75 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_21 .cse42))) (.cse76 (* ~b~0 4))) (= (select (select .cse75 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse76)) (select (select .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse76 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse78 (* ~b~0 4))) (= (select .cse77 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse78)) (let ((.cse80 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse79 .cse80)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse80) .cse78))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse81)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse82 .cse81 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse84 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (let ((.cse83 (select (select (store .cse85 .cse84 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse83 .cse84)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse83 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse74 (forall ((~a~0 Int)) (let ((.cse86 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse86 .cse7) (= c_~F~0.offset .cse86) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse87 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse87)) (= (select (select (store .cse88 .cse87 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse74 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse89 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse90 (select (select .cse89 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse89 .cse90 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse90)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5 .cse73) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse93 (* ~b~0 4)) (.cse94 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96)))) (let ((.cse92 (select .cse94 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse91 (select (select .cse94 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse93)))) (or (= .cse91 (select .cse92 (+ .cse93 v_arrayElimCell_23))) (= (select .cse92 (+ .cse93 v_arrayElimCell_22)) .cse91))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse100 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse97 (select (select .cse100 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse97) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse98 (store .cse18 .cse97 (store (select .cse18 .cse97) v_arrayElimCell_21 .cse19))) (.cse99 (* ~b~0 4))) (= (select (select .cse98 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse99)) (select (select .cse98 (select (select (store .cse100 .cse97 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse99 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse101 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse102 (* ~b~0 4))) (= (select (select .cse101 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (select (select .cse101 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse102 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse103) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse104 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 .cse96))) (.cse106 (* ~b~0 4))) (= (let ((.cse105 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse104 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse105)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse105) .cse106))) (select (select .cse104 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse106)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse109 (select (select .cse112 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse109)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse110 (store .cse18 .cse109 (store (select .cse18 .cse109) v_arrayElimCell_21 .cse19))) (.cse111 (* ~b~0 4))) (= (select (select .cse110 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse111)) (select (select .cse110 (select (select (store .cse112 .cse109 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse111 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse115 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse114 (select (select .cse115 c_~B~0.base) c_~B~0.offset))) (let ((.cse113 (select (select (store .cse115 .cse114 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse113) (< c_~N~0 (+ ~a~0 1)) (= .cse114 .cse113)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse119 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse118 (* ~b~0 4))) (let ((.cse116 (select (select .cse119 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse118))) (.cse117 (select .cse119 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_23))) (= .cse116 (select .cse117 (+ .cse118 v_arrayElimCell_22))))))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse120 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse121 (select (select .cse120 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse120 .cse121 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse121 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse122 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse123 (* ~b~0 4))) (= (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse123)) (select (select .cse122 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse123 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse48) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse124 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse125 (* ~b~0 4))) (= (select (select .cse124 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse125 v_arrayElimCell_22)) (select (select .cse124 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse125)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse55) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse126 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_21) .cse96))) (.cse127 (* ~b~0 4))) (= (select (select .cse126 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse127)) (select (select .cse126 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse127 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse48) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse130 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse131 (select (select .cse130 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse128 (store .cse18 .cse131 (store (select .cse18 .cse131) v_arrayElimCell_22 .cse19))) (.cse129 (* ~b~0 4))) (= (select (select .cse128 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse129)) (select (select .cse128 (select (select (store .cse130 .cse131 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse129 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse131))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse134 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse133 (select (select .cse134 c_~B~0.base) c_~B~0.offset))) (let ((.cse132 (select (select (store .cse134 .cse133 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse132) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse133 .cse132)))))) .cse5) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse135 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse107 .cse108 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse136 (* ~b~0 4))) (= (select (select .cse135 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse136)) (let ((.cse137 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse135 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse137)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse137) .cse136))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse138 (store |c_#memory_int| .cse40 (store .cse41 (+ .cse95 v_arrayElimCell_22) .cse96))) (.cse139 (* ~b~0 4))) (= (select (select .cse138 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse139)) (select (select .cse138 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse139 v_arrayElimCell_22)))))) .cse55) (or .cse103 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse140 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_21 .cse26))) (.cse141 (* ~b~0 4))) (= (select (select .cse140 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse141)) (select (select .cse140 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse141 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or (forall ((~a~0 Int)) (let ((.cse142 (* ~a~0 c_~M~0))) (let ((.cse143 (+ c_~A~0.offset (* .cse142 4)))) (or (= .cse142 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse143 .cse7) (= c_~F~0.offset .cse143) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse145 (* ~b~0 4)) (.cse147 (store |c_#memory_int| .cse40 (store .cse41 v_arrayElimCell_22 .cse42)))) (let ((.cse144 (select .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse146 (select (select .cse147 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse145)))) (or (= (select .cse144 (+ .cse145 v_arrayElimCell_23)) .cse146) (= (select .cse144 (+ .cse145 v_arrayElimCell_22)) .cse146))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse148 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse149 (* ~b~0 4))) (= (select (select .cse148 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse149)) (select (select .cse148 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse149 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse45) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse152 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse151 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse150 (select (select .cse152 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse150)) (< ~a~0 0) (= .cse151 .cse7) (= c_~F~0.offset .cse151) (= (select (select (store .cse152 .cse150 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (or .cse5 .cse30 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse5 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse155 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse154 (select (select .cse155 c_~B~0.base) c_~B~0.offset))) (let ((.cse153 (select (select (store .cse155 .cse154 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse153) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse154 .cse153))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse156 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse157 (select (select .cse156 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse156 .cse157 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse157)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse5) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse161 (store |c_#memory_int| .cse24 (store .cse25 v_arrayElimCell_22 .cse26))) (.cse160 (* ~b~0 4))) (let ((.cse158 (select (select .cse161 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse160))) (.cse159 (select .cse161 (select (select (store |c_#memory_$Pointer$.base| .cse24 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_22))) (= .cse158 (select .cse159 (+ .cse160 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse74 .cse0 .cse73 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse2) .cse3) (< c_~N~0 (+ ~a~0 1)))) .cse5) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse5)))))))) is different from true [2024-05-03 11:12:33,571 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_thread1Thread1of1ForFork0_~i~0 4)) (.cse103 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse52 (select .cse103 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse101 (select |c_#memory_int| c_~A~0.base)) (.cse199 (+ c_~A~0.offset .cse14)) (.cse28 (select .cse103 c_~B~0.offset))) (let ((.cse128 (= c_~B~0.base .cse28)) (.cse41 (< |c_ULTIMATE.start_main_~i~2#1| 0)) (.cse61 (< c_~M~0 2)) (.cse200 (select |c_#memory_int| c_~F~0.base)) (.cse201 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4)) (.cse119 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse22 (store |c_#memory_int| c_~A~0.base (store .cse101 .cse199 |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse73 (= .cse52 c_~B~0.base)) (.cse6 (< c_~M~0 1))) (let ((.cse17 (+ 2 c_~B~0.base)) (.cse60 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse0 (= c_~F~0.base c_~A~0.base)) (.cse47 (or .cse6 (< |c_ULTIMATE.start_main_~i~2#1| 1))) (.cse38 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base))) (.cse39 (not (= c_~B~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse40 (not (= c_~B~0.base c_~A~0.base))) (.cse64 (not .cse73)) (.cse23 (select (select .cse22 c_~F~0.base) c_~F~0.offset)) (.cse132 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse133 (+ .cse119 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse120 (select .cse200 (+ .cse119 .cse201 c_~F~0.offset))) (.cse76 (+ |c_#StackHeapBarrier| 1)) (.cse87 (< |c_ULTIMATE.start_main_#t~post12#1| 0)) (.cse86 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset))))) (.cse53 (select |c_#memory_int| .cse52)) (.cse54 (select .cse200 (+ .cse201 c_~F~0.offset))) (.cse125 (or .cse41 .cse61)) (.cse59 (not .cse128)) (.cse8 (+ c_~F~0.offset .cse14)) (.cse34 (< c_~N~0 1)) (.cse44 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) (.cse45 (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1)))) (.cse29 (select |c_#memory_int| .cse28)) (.cse30 (select .cse200 c_~F~0.offset)) (.cse98 (= .cse199 c_~F~0.offset)) (.cse1 (forall ((v_ArrVal_601 (Array Int Int))) (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) (.cse97 (= c_thread1Thread1of1ForFork0_~i~0 0)) (.cse3 (* 4 c_~M~0)) (.cse4 (+ 5 c_~F~0.offset)) (.cse46 (not (= c_~M~0 1)))) (and (= c_~F~0.offset 0) (not .cse0) (or .cse1 (let ((.cse5 (+ 2 c_thread1Thread1of1ForFork0_~i~0)) (.cse11 (* c_~A~0.offset (- 1)))) (and (or (forall ((~a~0 Int)) (let ((.cse2 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse2 4) .cse3) .cse4) (< (+ .cse2 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse7 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* .cse7 4) 1)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse7 1)))))) (or (forall ((~a~0 Int)) (let ((.cse9 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse8 (+ c_~A~0.offset (* .cse9 4) 1)) (< (+ .cse9 c_~M~0) .cse5) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or .cse6 (forall ((~a~0 Int)) (let ((.cse10 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse10 4) .cse3) .cse4) (< (+ (div (+ (- 1) .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0) .cse10) (< c_~N~0 (+ ~a~0 1)))))) (or (forall ((~a~0 Int)) (let ((.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ .cse12 c_~M~0) (+ 2 (div (+ .cse11 c_~F~0.offset) 4) c_thread1Thread1of1ForFork0_~i~0)) (< c_~F~0.offset (+ c_~A~0.offset (* .cse12 4) 1)) (< c_~N~0 (+ ~a~0 1))))) .cse6) (or (forall ((~a~0 Int)) (let ((.cse13 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< (+ c_~A~0.offset (* .cse13 4) .cse3) (+ 5 c_~F~0.offset .cse14)) (< c_~N~0 (+ ~a~0 1)) (< c_thread1Thread1of1ForFork0_~i~0 (+ .cse13 1))))) .cse6)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse15 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (= .cse15 (select (select (store .cse16 .cse15 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))))))) (<= .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse21 (select (select .cse20 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse18 (store .cse22 .cse21 (store (select .cse22 .cse21) v_arrayElimCell_22 .cse23))) (.cse19 (* ~b~0 4))) (= (select (select .cse18 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse19)) (select (select .cse18 (select (select (store .cse20 .cse21 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse19 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) (not (= c_~B~0.base .cse21)))))) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse27 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse25 (* ~b~0 4))) (let ((.cse26 (select (select .cse27 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse25))) (.cse24 (select .cse27 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse24 (+ .cse25 v_arrayElimCell_23)) .cse26) (= .cse26 (select .cse24 (+ .cse25 v_arrayElimCell_22))))))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or (< c_~N~0 2) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse32 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (let ((.cse31 (select (select (store .cse33 .cse32 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse31 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)) (= .cse31 .cse32))))))) (or (forall ((v_ArrVal_601 (Array Int Int))) (not (= c_~B~0.base (select (select (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset)))) .cse6 .cse34) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse36 (select (select .cse37 c_~B~0.base) c_~B~0.offset))) (let ((.cse35 (select (select (store .cse37 .cse36 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse35) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse35 .cse36))))))) (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~L~0) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~M~0) (or (and .cse38 (not (= |c_ULTIMATE.start_main_#t~ret13#1.base| c_~B~0.base)) .cse39 .cse40) .cse6 .cse41) (= |c_ULTIMATE.start_main_~i~2#1| 0) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse43 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse42 (select (select .cse43 c_~B~0.base) c_~B~0.offset))) (= .cse42 (select (select (store .cse43 .cse42 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (and .cse44 .cse45 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_#t~ret9#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_#t~ret9#1.base|))))) .cse46) .cse47 (= |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse51 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse49 (* ~b~0 4))) (let ((.cse50 (select (select .cse51 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse49))) (.cse48 (select .cse51 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= (select .cse48 (+ .cse49 v_arrayElimCell_23)) .cse50) (= .cse50 (select .cse48 (+ .cse49 v_arrayElimCell_22))))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) (< c_~M~0 (+ ~b~0 1)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse56 (select (select .cse55 c_~B~0.base) c_~B~0.offset))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base (select (select (store .cse55 .cse56 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse56)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse57 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse58 (* ~b~0 4))) (= (select (select .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse58 v_arrayElimCell_23)) (select (select .cse57 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse58)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) .cse59) .cse60 (or .cse34 .cse61) (<= .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse62 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse63 (* ~b~0 4))) (= (select (select .cse62 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse63 v_arrayElimCell_23)) (select (select .cse62 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse63)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse64) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse65 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse66 (select (select .cse65 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse65 .cse66 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse66))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse68 (select (select .cse67 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse67 .cse68 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse68)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse69 (select (select .cse70 c_~B~0.base) c_~B~0.offset))) (= .cse69 (select (select (store .cse70 .cse69 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse71 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54))) (.cse72 (* ~b~0 4))) (= (select (select .cse71 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse72 v_arrayElimCell_22)) (select (select .cse71 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse72)))))) .cse73) (or .cse64 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse74 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54))) (.cse75 (* ~b~0 4))) (= (select (select .cse74 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse75 v_arrayElimCell_23)) (select (select .cse74 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse75)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1))))) (<= .cse76 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse79 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse78 (select (select .cse79 c_~B~0.base) c_~B~0.offset))) (let ((.cse77 (select (select (store .cse79 .cse78 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse77) (< c_~N~0 (+ ~a~0 1)) (= .cse78 .cse77)))))) .cse6) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse85 (select (select .cse84 c_~B~0.base) c_~B~0.offset))) (let ((.cse83 (store .cse22 .cse85 (store (select .cse22 .cse85) v_arrayElimCell_21 .cse23))) (.cse82 (* ~b~0 4))) (let ((.cse80 (select (select .cse83 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse82))) (.cse81 (select .cse83 (select (select (store .cse84 .cse85 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse80 (select .cse81 (+ .cse82 v_arrayElimCell_22))) (= .cse80 (select .cse81 (+ .cse82 v_arrayElimCell_23))))))))) (< ~a~0 0) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~M~0) (or .cse86 .cse6 .cse34) (= (select |c_#valid| c_~B~0.base) 1) (or .cse87 .cse61) (or .cse6 (and .cse38 .cse60 .cse39 .cse40) .cse41) (forall ((v_ArrVal_601 (Array Int Int)) (~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse92 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse93 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (let ((.cse91 (store .cse22 .cse93 (store (select .cse22 .cse93) v_arrayElimCell_22 .cse23))) (.cse90 (* ~b~0 4))) (let ((.cse88 (select (select .cse91 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse90))) (.cse89 (select .cse91 (select (select (store .cse92 .cse93 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse88 (select .cse89 (+ .cse90 v_arrayElimCell_22))) (= .cse88 (select .cse89 (+ .cse90 v_arrayElimCell_23))))))))) (< c_~N~0 (+ ~a~0 1)))))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse96 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse95 (select (select .cse96 c_~B~0.base) c_~B~0.offset))) (let ((.cse94 (select (select (store .cse96 .cse95 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~A~0.base .cse94) (= .cse95 .cse94))))))) (or .cse6 .cse97 (and (or .cse34 .cse0) (or .cse98 (forall ((~a~0 Int)) (or (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1))))))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse99 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_21 .cse54))) (.cse100 (* ~b~0 4))) (= (select (select .cse99 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse100)) (select (select .cse99 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse100 v_arrayElimCell_22)))) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse73) (<= 1 c_~L~0) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 c_~M~0) (forall ((~a~0 Int) (~b~0 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse102 (* ~b~0 4))) (= (select .cse101 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse102)) (let ((.cse104 (+ (* ~a~0 4) c_~B~0.offset))) (select (select |c_#memory_int| (select .cse103 .cse104)) (+ (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) .cse104) .cse102))))) (< c_~N~0 (+ ~a~0 1)))) (or (and (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse106 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse105 (select (select .cse106 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse105)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= (select (select (store .cse106 .cse105 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1))))))) (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse108 (select (select .cse109 c_~B~0.base) c_~B~0.offset))) (let ((.cse107 (select (select (store .cse109 .cse108 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (not (= .cse107 .cse108)) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse107 c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))))) (or .cse98 (forall ((~a~0 Int)) (let ((.cse110 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4)))) (or (< ~a~0 0) (= .cse110 .cse8) (= c_~F~0.offset .cse110) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int))) (let ((.cse112 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse111 (select (select .cse112 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse111)) (= (select (select (store .cse112 .cse111 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base))))))))) (or .cse98 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (or (not (let ((.cse113 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse114 (select (select .cse113 c_~B~0.base) c_~B~0.offset))) (= (select (select (store .cse113 .cse114 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse114)))) (< ~a~0 0) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6 .cse97) (= c_~B~0.offset 0) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse117 (* ~b~0 4)) (.cse118 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120)))) (let ((.cse116 (select .cse118 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse115 (select (select .cse118 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse117)))) (or (= .cse115 (select .cse116 (+ .cse117 v_arrayElimCell_23))) (= (select .cse116 (+ .cse117 v_arrayElimCell_22)) .cse115))))) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse124 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse121 (select (select .cse124 c_~B~0.base) c_~B~0.offset))) (or (= c_~B~0.base .cse121) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse122 (store .cse22 .cse121 (store (select .cse22 .cse121) v_arrayElimCell_21 .cse23))) (.cse123 (* ~b~0 4))) (= (select (select .cse122 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse123)) (select (select .cse122 (select (select (store .cse124 .cse121 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse123 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (not (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (and .cse47 .cse125 (or .cse6 .cse41 (and .cse38 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|)) .cse39 .cse40)))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse126 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse127 (* ~b~0 4))) (= (select (select .cse126 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse127)) (select (select .cse126 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse127 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse128) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse129 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse132 .cse133 .cse120))) (.cse131 (* ~b~0 4))) (= (let ((.cse130 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse129 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse130)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse130) .cse131))) (select (select .cse129 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse131)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse134 (select (select .cse137 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~B~0.base .cse134)) (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse135 (store .cse22 .cse134 (store (select .cse22 .cse134) v_arrayElimCell_21 .cse23))) (.cse136 (* ~b~0 4))) (= (select (select .cse135 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse136)) (select (select .cse135 (select (select (store .cse137 .cse134 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse136 v_arrayElimCell_23)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1)))))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse140 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse139 (select (select .cse140 c_~B~0.base) c_~B~0.offset))) (let ((.cse138 (select (select (store .cse140 .cse139 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse138) (< c_~N~0 (+ ~a~0 1)) (= .cse139 .cse138)))))) .cse6) (or (< |c_ULTIMATE.start_main_#t~post12#1| 1) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (< c_~M~0 (+ ~b~0 1)) (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse144 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse143 (* ~b~0 4))) (let ((.cse141 (select (select .cse144 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse143))) (.cse142 (select .cse144 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse141 (select .cse142 (+ .cse143 v_arrayElimCell_23))) (= .cse141 (select .cse142 (+ .cse143 v_arrayElimCell_22))))))))))) (or (and .cse44 .cse45 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)))) .cse46) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse145 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse146 (select (select .cse145 c_~B~0.base) c_~B~0.offset))) (or (= c_~A~0.base (select (select (store .cse145 .cse146 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (< ~a~0 0) (not (= .cse146 c_~A~0.base)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse149 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse148 (select (select .cse149 c_~B~0.base) c_~B~0.offset))) (let ((.cse147 (select (select (store .cse149 .cse148 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~A~0.base .cse147) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse148 .cse147))))))) (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| c_~L~0) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (let ((.cse150 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse151 (* ~b~0 4))) (= (select (select .cse150 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse151)) (select (select .cse150 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse151 v_arrayElimCell_23)))) (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) .cse64) (or (and .cse38 .cse39 (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse40) .cse6 .cse41) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse152 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120))) (.cse153 (* ~b~0 4))) (= (select (select .cse152 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse153 v_arrayElimCell_22)) (select (select .cse152 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse153)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse73) .cse40 (= (select |c_#valid| c_~A~0.base) 1) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_23 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse154 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_21) .cse120))) (.cse155 (* ~b~0 4))) (= (select (select .cse154 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse155)) (select (select .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse155 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)) (= c_thread2Thread1of1ForFork1_~i~1 ~a~0))) .cse64) (or .cse86 .cse6 .cse41) (forall ((v_ArrVal_601 (Array Int Int))) (let ((.cse158 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse159 (select (select .cse158 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (let ((.cse156 (store .cse22 .cse159 (store (select .cse22 .cse159) v_arrayElimCell_22 .cse23))) (.cse157 (* ~b~0 4))) (= (select (select .cse156 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse157)) (select (select .cse156 (select (select (store .cse158 .cse159 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse157 v_arrayElimCell_22)))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= c_~B~0.base .cse159))))) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse161 (select (select .cse162 c_~B~0.base) c_~B~0.offset))) (let ((.cse160 (select (select (store .cse162 .cse161 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~A~0.base .cse160) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse161 .cse160)))))) .cse6) (forall ((~a~0 Int) (v_ArrVal_603 (Array Int Int)) (~b~0 Int) (v_ArrVal_604 (Array Int Int))) (or (< ~b~0 0) (let ((.cse163 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse132 .cse133 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse164 (* ~b~0 4))) (= (select (select .cse163 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse164)) (let ((.cse165 (+ (* ~a~0 4) c_~B~0.offset))) (select (select .cse163 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_603) c_~B~0.base) .cse165)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_604) c_~B~0.base) .cse165) .cse164))))) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (< c_~N~0 (+ ~a~0 1)) (let ((.cse166 (store |c_#memory_int| .cse52 (store .cse53 (+ .cse119 v_arrayElimCell_22) .cse120))) (.cse167 (* ~b~0 4))) (= (select (select .cse166 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse167)) (select (select .cse166 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse167 v_arrayElimCell_22)))))) .cse73) (<= .cse76 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and .cse44 .cse45 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0)))) .cse46) (or .cse128 (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse168 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_21 .cse30))) (.cse169 (* ~b~0 4))) (= (select (select .cse168 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse169)) (select (select .cse168 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse169 v_arrayElimCell_22)))) (= ~a~0 0) (< c_~N~0 (+ ~a~0 1))))) (or .cse87 .cse86 .cse6) (or (forall ((~a~0 Int)) (let ((.cse170 (* ~a~0 c_~M~0))) (let ((.cse171 (+ c_~A~0.offset (* .cse170 4)))) (or (= .cse170 c_thread1Thread1of1ForFork0_~i~0) (< ~a~0 0) (= .cse171 .cse8) (= c_~F~0.offset .cse171) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse173 (* ~b~0 4)) (.cse175 (store |c_#memory_int| .cse52 (store .cse53 v_arrayElimCell_22 .cse54)))) (let ((.cse172 (select .cse175 (select (select (store |c_#memory_$Pointer$.base| .cse52 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (.cse174 (select (select .cse175 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse173)))) (or (= (select .cse172 (+ .cse173 v_arrayElimCell_23)) .cse174) (= (select .cse172 (+ .cse173 v_arrayElimCell_22)) .cse174))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) .cse125 (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< ~a~0 0) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (let ((.cse177 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse176 (select (select .cse177 c_~B~0.base) c_~B~0.offset))) (= .cse176 (select (select (store .cse177 .cse176 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))))) .cse6) (or (forall ((~a~0 Int) (~b~0 Int) (v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (or (< ~b~0 0) (< ~a~0 0) (< c_~M~0 (+ ~b~0 1)) (let ((.cse178 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse179 (* ~b~0 4))) (= (select (select .cse178 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse179)) (select (select .cse178 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse179 v_arrayElimCell_23)))) (< c_~N~0 (+ ~a~0 1)))) .cse59) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int))) (let ((.cse182 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_601))) (let ((.cse181 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (.cse180 (select (select .cse182 c_~B~0.base) c_~B~0.offset))) (or (not (= c_~A~0.base .cse180)) (< ~a~0 0) (= .cse181 .cse8) (= c_~F~0.offset .cse181) (= (select (select (store .cse182 .cse180 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse185 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse184 (select (select .cse185 c_~B~0.base) c_~B~0.offset))) (let ((.cse183 (select (select (store .cse185 .cse184 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< |c_ULTIMATE.start_main_~i~2#1| ~a~0) (< ~a~0 0) (= c_~F~0.base .cse183) (= .cse184 .cse183)))))) .cse6) (or .cse6 .cse34 (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601) c_~B~0.base) c_~B~0.offset) c_~B~0.base)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (let ((.cse188 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse187 (select (select .cse188 c_~B~0.base) c_~B~0.offset))) (let ((.cse186 (select (select (store .cse188 .cse187 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= c_~F~0.base .cse186) (< ~a~0 0) (< c_~N~0 (+ ~a~0 1)) (= .cse187 .cse186))))))) (or (and .cse44 (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base|) 0))) .cse45) .cse46 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse189 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse190 (select (select .cse189 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= c_~A~0.base (select (select (store .cse189 .cse190 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (not (= c_~A~0.base .cse190)) (= c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< c_~N~0 (+ ~a~0 1)))))) .cse6) (forall ((~b~0 Int)) (or (< ~b~0 0) (forall ((~a~0 Int)) (or (< ~a~0 0) (forall ((v_ArrVal_603 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse194 (store |c_#memory_int| .cse28 (store .cse29 v_arrayElimCell_22 .cse30))) (.cse193 (* ~b~0 4))) (let ((.cse191 (select (select .cse194 c_~A~0.base) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse193))) (.cse192 (select .cse194 (select (select (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))))) (or (= .cse191 (select .cse192 (+ .cse193 v_arrayElimCell_22))) (= .cse191 (select .cse192 (+ .cse193 v_arrayElimCell_23))))))) (< c_~N~0 (+ ~a~0 1)))) (< c_~M~0 (+ ~b~0 1)))) (or .cse6 (forall ((v_ArrVal_601 (Array Int Int)) (~a~0 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse197 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_599) c_~A~0.base v_ArrVal_601))) (let ((.cse196 (select (select .cse197 c_~B~0.base) c_~B~0.offset))) (let ((.cse195 (select (select (store .cse197 .cse196 v_ArrVal_603) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= c_~F~0.base .cse195) (< |c_ULTIMATE.start_main_#t~post12#1| ~a~0) (= .cse196 .cse195))))))) (or .cse98 .cse1 .cse97 (and (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse3) .cse4) (< c_~N~0 (+ ~a~0 1)))) .cse6) (or (forall ((~a~0 Int)) (or (< ~a~0 0) (< c_~F~0.offset (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< c_~N~0 (+ ~a~0 1)))) .cse6))) (or (let ((.cse198 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_38|) 0))))) (and (or .cse198 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or .cse198 (not (= c_~A~0.base |c_ULTIMATE.start_main_#t~malloc11#1.base|))) (or (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|)) .cse198) (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc11#1.base|) 0)))) .cse46)))))) is different from true [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:12:53,358 INFO L78 Accepts]: Start accepts. Automaton has currently 4592 states, but on-demand construction may add more states Word has length 255 [2024-05-03 11:12:53,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:12:53,368 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-05-03 11:12:53,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:12:53,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:12:53,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:12:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 969077090, now seen corresponding path program 2 times [2024-05-03 11:12:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:12:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877095485] [2024-05-03 11:12:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:12:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:12:53,591 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:12:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476533953] [2024-05-03 11:12:53,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 11:12:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:12:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:12:53,593 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-05-03 11:12:53,595 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-05-03 11:12:53,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 11:12:53,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:12:53,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-03 11:12:53,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:12:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-03 11:12:53,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:12:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-03 11:12:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:12:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877095485] [2024-05-03 11:12:54,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:12:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476533953] [2024-05-03 11:12:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476533953] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:12:54,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:12:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-05-03 11:12:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943517498] [2024-05-03 11:12:54,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:12:54,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-03 11:12:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:12:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-03 11:12:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-05-03 11:12:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:54,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:12:54,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.526315789473685) internal successors, (295), 19 states have internal predecessors, (295), 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-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:12:54,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:12:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:12:54,809 INFO L78 Accepts]: Start accepts. Automaton has currently 8144 states, but on-demand construction may add more states Word has length 264 [2024-05-03 11:12:54,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:12:54,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-03 11:12:55,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-03 11:12:55,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:12:55,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:12:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -974132272, now seen corresponding path program 3 times [2024-05-03 11:12:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:12:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125296120] [2024-05-03 11:12:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:12:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:12:55,031 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:12:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205194530] [2024-05-03 11:12:55,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 11:12:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:12:55,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:12:55,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:12:55,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-03 11:12:55,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-03 11:12:55,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:12:55,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-03 11:12:55,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:12:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-03 11:12:56,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:12:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-03 11:12:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:12:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125296120] [2024-05-03 11:12:57,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:12:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205194530] [2024-05-03 11:12:57,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205194530] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:12:57,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:12:57,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-05-03 11:12:57,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207107777] [2024-05-03 11:12:57,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:12:57,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-03 11:12:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:12:57,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-03 11:12:57,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-05-03 11:12:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:57,347 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:12:57,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.181818181818183) internal successors, (422), 22 states have internal predecessors, (422), 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-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:12:57,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:12:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:12:59,491 INFO L78 Accepts]: Start accepts. Automaton has currently 18017 states, but on-demand construction may add more states Word has length 285 [2024-05-03 11:12:59,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:12:59,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-03 11:12:59,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:12:59,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:12:59,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:12:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash -848205528, now seen corresponding path program 4 times [2024-05-03 11:12:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:12:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444396253] [2024-05-03 11:12:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:12:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:12:59,710 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:12:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588898665] [2024-05-03 11:12:59,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 11:12:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:12:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:12:59,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:12:59,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-03 11:12:59,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 11:12:59,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:12:59,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-03 11:12:59,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:13:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-03 11:13:00,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:13:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-03 11:13:00,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:13:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444396253] [2024-05-03 11:13:00,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:13:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588898665] [2024-05-03 11:13:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588898665] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:13:00,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:13:00,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-05-03 11:13:00,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796414887] [2024-05-03 11:13:00,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:13:00,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-03 11:13:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:13:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-03 11:13:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-05-03 11:13:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:00,463 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:13:00,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 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-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:00,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:01,213 INFO L78 Accepts]: Start accepts. Automaton has currently 18035 states, but on-demand construction may add more states Word has length 301 [2024-05-03 11:13:01,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:13:01,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-05-03 11:13:01,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-03 11:13:01,415 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:13:01,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:13:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1222648768, now seen corresponding path program 5 times [2024-05-03 11:13:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:13:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620134917] [2024-05-03 11:13:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:13:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:13:01,435 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:13:01,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230324653] [2024-05-03 11:13:01,435 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 11:13:01,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:01,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:13:01,436 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:13:01,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-03 11:13:20,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-03 11:13:20,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:13:20,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-03 11:13:20,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:13:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-03 11:13:20,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:13:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-03 11:13:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:13:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620134917] [2024-05-03 11:13:21,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:13:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230324653] [2024-05-03 11:13:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230324653] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:13:21,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:13:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-05-03 11:13:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218835577] [2024-05-03 11:13:21,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:13:21,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-03 11:13:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:13:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-03 11:13:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-05-03 11:13:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:21,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:13:21,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 14.09375) internal successors, (451), 32 states have internal predecessors, (451), 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-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:21,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 11:13:22,282 INFO L78 Accepts]: Start accepts. Automaton has currently 18059 states, but on-demand construction may add more states Word has length 333 [2024-05-03 11:13:22,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:13:22,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-03 11:13:22,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-05-03 11:13:22,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:13:22,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:13:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1146638064, now seen corresponding path program 6 times [2024-05-03 11:13:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:13:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150118473] [2024-05-03 11:13:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:13:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:13:22,510 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:13:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396685349] [2024-05-03 11:13:22,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-03 11:13:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:22,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:13:22,511 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:13:22,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-03 11:13:23,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-05-03 11:13:23,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:13:23,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-03 11:13:23,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:13:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 40 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-03 11:13:24,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:13:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 45 proven. 41 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-03 11:13:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:13:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150118473] [2024-05-03 11:13:25,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:13:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396685349] [2024-05-03 11:13:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396685349] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:13:25,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:13:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2024-05-03 11:13:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666934650] [2024-05-03 11:13:25,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:13:25,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-05-03 11:13:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:13:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-05-03 11:13:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2024-05-03 11:13:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:25,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:13:25,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 11.666666666666666) internal successors, (455), 39 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-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 11:13:25,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 11:13:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-03 11:13:28,095 INFO L78 Accepts]: Start accepts. Automaton has currently 18136 states, but on-demand construction may add more states Word has length 381 [2024-05-03 11:13:28,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:13:28,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-03 11:13:28,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:28,298 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:13:28,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:13:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1682367302, now seen corresponding path program 7 times [2024-05-03 11:13:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:13:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979788075] [2024-05-03 11:13:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:13:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:13:28,337 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:13:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273111889] [2024-05-03 11:13:28,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-03 11:13:28,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:13:28,338 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:13:28,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-03 11:13:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:13:28,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-03 11:13:28,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:13:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 30 proven. 70 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-03 11:13:28,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:13:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-03 11:13:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:13:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979788075] [2024-05-03 11:13:29,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:13:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273111889] [2024-05-03 11:13:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273111889] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:13:29,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-05-03 11:13:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2024-05-03 11:13:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396190126] [2024-05-03 11:13:29,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-05-03 11:13:29,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-03 11:13:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:13:29,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-03 11:13:29,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-05-03 11:13:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:29,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:13:29,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 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-05-03 11:13:29,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:29,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:29,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:29,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:29,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-03 11:13:29,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 11:13:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-03 11:13:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-03 11:13:29,888 INFO L78 Accepts]: Start accepts. Automaton has currently 26072 states, but on-demand construction may add more states Word has length 406 [2024-05-03 11:13:29,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:13:29,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-03 11:13:30,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:30,091 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:13:30,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:13:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash -270250118, now seen corresponding path program 8 times [2024-05-03 11:13:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:13:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628809528] [2024-05-03 11:13:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:13:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:13:30,115 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-05-03 11:13:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1374581420] [2024-05-03 11:13:30,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 11:13:30,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:13:30,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:13:30,117 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 11:13:30,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-03 11:13:31,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 11:13:31,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:13:31,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 300 conjunts are in the unsatisfiable core [2024-05-03 11:13:31,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:13:31,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-05-03 11:13:33,143 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-05-03 11:13:33,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-05-03 11:13:35,025 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-05-03 11:13:35,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-05-03 11:13:36,432 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2024-05-03 11:13:36,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2024-05-03 11:13:39,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-03 11:13:39,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-03 11:13:41,474 INFO L349 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2024-05-03 11:13:41,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 36 [2024-05-03 11:13:42,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-05-03 11:13:42,497 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 16 treesize of output 11 [2024-05-03 11:13:43,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-05-03 11:13:43,390 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 15 treesize of output 1 [2024-05-03 11:13:43,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2024-05-03 11:13:44,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-03 11:13:44,513 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 52 treesize of output 28 [2024-05-03 11:13:44,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 11:13:45,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:13:45,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2024-05-03 11:13:45,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 11:13:45,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:13:45,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-03 11:13:46,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:13:46,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-03 11:13:46,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-03 11:13:46,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:13:46,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 57 [2024-05-03 11:13:47,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-03 11:13:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2024-05-03 11:13:47,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-05-03 11:13:48,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 50 [2024-05-03 11:13:48,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-05-03 11:13:48,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2024-05-03 11:13:50,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2024-05-03 11:13:50,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-05-03 11:13:50,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2024-05-03 11:13:51,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-03 11:13:51,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 95 [2024-05-03 11:13:51,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2024-05-03 11:13:51,896 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 31 treesize of output 16 [2024-05-03 11:13:52,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2024-05-03 11:13:52,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 80 [2024-05-03 11:13:52,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-05-03 11:13:55,399 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-03 11:13:55,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 121 [2024-05-03 11:13:55,452 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 31 treesize of output 16 [2024-05-03 11:13:55,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 94 [2024-05-03 11:13:58,299 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-03 11:13:58,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 121 [2024-05-03 11:13:58,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 16 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 108 [2024-05-03 11:13:58,342 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 31 treesize of output 16 [2024-05-03 11:14:00,468 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-05-03 11:14:00,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 134 [2024-05-03 11:14:00,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-05-03 11:14:00,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 16 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 122 [2024-05-03 11:14:05,411 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-05-03 11:14:05,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 24 treesize of output 13 [2024-05-03 11:14:05,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:14:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 145 treesize of output 103 [2024-05-03 11:14:06,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:14:06,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-03 11:14:07,493 INFO L349 Elim1Store]: treesize reduction 756, result has 41.9 percent of original size [2024-05-03 11:14:07,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 8 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 283 treesize of output 673 [2024-05-03 11:16:37,188 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-05-03 11:16:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:16:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628809528] [2024-05-03 11:16:37,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-05-03 11:16:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374581420] [2024-05-03 11:16:37,189 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-03 11:16:37,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-05-03 11:16:37,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-03 11:16:37,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-03 11:16:37,390 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 65 more [2024-05-03 11:16:37,394 INFO L158 Benchmark]: Toolchain (without parser) took 376857.20ms. Allocated memory was 273.7MB in the beginning and 1.1GB in the end (delta: 820.0MB). Free memory was 201.5MB in the beginning and 647.1MB in the end (delta: -445.7MB). Peak memory consumption was 670.3MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 273.7MB. Free memory is still 240.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.07ms. Allocated memory is still 273.7MB. Free memory was 201.2MB in the beginning and 188.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.14ms. Allocated memory is still 273.7MB. Free memory was 188.9MB in the beginning and 186.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: Boogie Preprocessor took 35.44ms. Allocated memory is still 273.7MB. Free memory was 186.5MB in the beginning and 184.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: RCFGBuilder took 615.24ms. Allocated memory is still 273.7MB. Free memory was 184.4MB in the beginning and 226.7MB in the end (delta: -42.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,395 INFO L158 Benchmark]: TraceAbstraction took 375971.59ms. Allocated memory was 273.7MB in the beginning and 1.1GB in the end (delta: 820.0MB). Free memory was 225.7MB in the beginning and 647.1MB in the end (delta: -421.5MB). Peak memory consumption was 694.9MB. Max. memory is 8.0GB. [2024-05-03 11:16:37,396 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 273.7MB. Free memory is still 240.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.07ms. Allocated memory is still 273.7MB. Free memory was 201.2MB in the beginning and 188.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.14ms. Allocated memory is still 273.7MB. Free memory was 188.9MB in the beginning and 186.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.44ms. Allocated memory is still 273.7MB. Free memory was 186.5MB in the beginning and 184.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.24ms. Allocated memory is still 273.7MB. Free memory was 184.4MB in the beginning and 226.7MB in the end (delta: -42.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 375971.59ms. Allocated memory was 273.7MB in the beginning and 1.1GB in the end (delta: 820.0MB). Free memory was 225.7MB in the beginning and 647.1MB in the end (delta: -421.5MB). Peak memory consumption was 694.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-05-03 11:16:37,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...