/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/popl20-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 11:33:33,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 11:33:33,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 11:33:33,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 11:33:33,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 11:33:33,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 11:33:33,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 11:33:33,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 11:33:33,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 11:33:33,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 11:33:33,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 11:33:33,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 11:33:33,306 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 11:33:33,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 11:33:33,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 11:33:33,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 11:33:33,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 11:33:33,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 11:33:33,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 11:33:33,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 11:33:33,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 11:33:33,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 11:33:33,311 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 11:33:33,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 11:33:33,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 11:33:33,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 11:33:33,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 11:33:33,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 11:33:33,313 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 11:33:33,313 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:33:33,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 11:33:33,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 11:33:33,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 11:33:33,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 11:33:33,518 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 11:33:33,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2024-05-03 11:33:34,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 11:33:34,754 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 11:33:34,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2024-05-03 11:33:34,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/67817b41e/7fb88e36f7b64220aa27b9ff1f55dbc5/FLAG2ef8d6f36 [2024-05-03 11:33:34,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/67817b41e/7fb88e36f7b64220aa27b9ff1f55dbc5 [2024-05-03 11:33:34,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 11:33:34,783 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 11:33:34,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 11:33:34,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 11:33:34,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 11:33:34,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 11:33:34" (1/1) ... [2024-05-03 11:33:34,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d60c65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:34, skipping insertion in model container [2024-05-03 11:33:34,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 11:33:34" (1/1) ... [2024-05-03 11:33:34,811 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 11:33:34,970 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/popl20-counter-fun.wvr.c[2681,2694] [2024-05-03 11:33:34,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 11:33:35,019 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 11:33:35,050 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/popl20-counter-fun.wvr.c[2681,2694] [2024-05-03 11:33:35,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 11:33:35,067 INFO L206 MainTranslator]: Completed translation [2024-05-03 11:33:35,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35 WrapperNode [2024-05-03 11:33:35,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 11:33:35,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 11:33:35,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 11:33:35,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 11:33:35,075 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:33:35" (1/1) ... [2024-05-03 11:33:35,089 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:33:35" (1/1) ... [2024-05-03 11:33:35,119 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 201 [2024-05-03 11:33:35,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 11:33:35,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 11:33:35,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 11:33:35,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 11:33:35,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 11:33:35,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 11:33:35,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 11:33:35,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 11:33:35,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (1/1) ... [2024-05-03 11:33:35,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 11:33:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:33:35,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 11:33:35,232 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:33:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 11:33:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 11:33:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 11:33:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 11:33:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 11:33:35,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 11:33:35,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 11:33:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 11:33:35,246 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:33:35,352 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 11:33:35,354 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 11:33:35,627 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 11:33:35,723 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 11:33:35,723 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-03 11:33:35,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 11:33:35 BoogieIcfgContainer [2024-05-03 11:33:35,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 11:33:35,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 11:33:35,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 11:33:35,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 11:33:35,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 11:33:34" (1/3) ... [2024-05-03 11:33:35,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71574bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 11:33:35, skipping insertion in model container [2024-05-03 11:33:35,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 11:33:35" (2/3) ... [2024-05-03 11:33:35,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71574bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 11:33:35, skipping insertion in model container [2024-05-03 11:33:35,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 11:33:35" (3/3) ... [2024-05-03 11:33:35,730 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2024-05-03 11:33:35,737 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 11:33:35,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 11:33:35,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 11:33:35,745 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 11:33:35,805 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 11:33:35,843 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 11:33:35,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 11:33:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:33:35,860 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:33:35,875 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:33:35,919 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 11:33:35,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 11:33:35,929 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;@e852c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 11:33:35,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 11:33:36,121 INFO L78 Accepts]: Start accepts. Automaton has currently 203 states, but on-demand construction may add more states Word has length 124 [2024-05-03 11:33:36,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:36,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:36,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1892829697, now seen corresponding path program 1 times [2024-05-03 11:33:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550655015] [2024-05-03 11:33:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:36,375 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:33:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550655015] [2024-05-03 11:33:36,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550655015] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:33:36,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:33:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 11:33:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957191794] [2024-05-03 11:33:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:33:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 11:33:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:33:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 11:33:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 11:33:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,404 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:33:36,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 11:33:36,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,429 INFO L78 Accepts]: Start accepts. Automaton has currently 203 states, but on-demand construction may add more states Word has length 119 [2024-05-03 11:33:36,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:36,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 11:33:36,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:36,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1556812090, now seen corresponding path program 1 times [2024-05-03 11:33:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126481365] [2024-05-03 11:33:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:36,715 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:33:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:36,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126481365] [2024-05-03 11:33:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126481365] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:33:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:33:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-03 11:33:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950084566] [2024-05-03 11:33:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:33:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-03 11:33:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:33:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-03 11:33:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-03 11:33:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:33:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:33:36,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:36,863 INFO L78 Accepts]: Start accepts. Automaton has currently 188 states, but on-demand construction may add more states Word has length 134 [2024-05-03 11:33:36,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:36,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 11:33:36,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:36,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 892513698, now seen corresponding path program 1 times [2024-05-03 11:33:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:36,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791193375] [2024-05-03 11:33:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-03 11:33:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791193375] [2024-05-03 11:33:37,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791193375] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:33:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:33:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-03 11:33:37,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852967347] [2024-05-03 11:33:37,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:33:37,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 11:33:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:33:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 11:33:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-03 11:33:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:33:37,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 11:33:37,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:37,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:33:37,313 INFO L78 Accepts]: Start accepts. Automaton has currently 196 states, but on-demand construction may add more states Word has length 142 [2024-05-03 11:33:37,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 11:33:37,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:37,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash -235043056, now seen corresponding path program 1 times [2024-05-03 11:33:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856492568] [2024-05-03 11:33:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:33:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856492568] [2024-05-03 11:33:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856492568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 11:33:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 11:33:37,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 11:33:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522209684] [2024-05-03 11:33:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 11:33:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 11:33:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:33:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 11:33:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-03 11:33:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,445 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:33:37,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:33:37,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:37,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:33:37,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:33:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:33:37,534 INFO L78 Accepts]: Start accepts. Automaton has currently 204 states, but on-demand construction may add more states Word has length 150 [2024-05-03 11:33:37,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:37,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-03 11:33:37,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:37,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1538505189, now seen corresponding path program 1 times [2024-05-03 11:33:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532644025] [2024-05-03 11:33:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:33:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532644025] [2024-05-03 11:33:37,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532644025] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 11:33:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065617905] [2024-05-03 11:33:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:33:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:33:37,754 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:33:37,776 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:33:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:37,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-03 11:33:37,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:33:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:33:38,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:33:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:33:38,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065617905] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:33:38,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 11:33:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-05-03 11:33:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142950940] [2024-05-03 11:33:38,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 11:33:38,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-03 11:33:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:33:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-03 11:33:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-05-03 11:33:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:38,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:33:38,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.8125) internal successors, (189), 16 states have internal predecessors, (189), 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:33:38,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:38,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:38,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:33:38,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:33:38,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:33:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:33:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:33:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:33:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-03 11:33:38,248 INFO L78 Accepts]: Start accepts. Automaton has currently 210 states, but on-demand construction may add more states Word has length 155 [2024-05-03 11:33:38,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:33:38,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 11:33:38,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:33:38,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:33:38,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:33:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 654250829, now seen corresponding path program 2 times [2024-05-03 11:33:38,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:33:38,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378542570] [2024-05-03 11:33:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:33:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:33:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:33:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-03 11:33:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:33:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378542570] [2024-05-03 11:33:38,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378542570] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 11:33:38,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276484050] [2024-05-03 11:33:38,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 11:33:38,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:33:38,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:33:38,822 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:33:38,848 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:33:38,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 11:33:38,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:33:38,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 48 conjunts are in the unsatisfiable core [2024-05-03 11:33:38,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:33:39,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-03 11:33:39,950 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:33:40,021 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:33:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:33:40,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:33:40,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_116 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int) (v_subst_1 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_117))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret19#1.base|)) (.cse1 (select (select .cse2 ~f~0.base) (+ (* c_~counter~0 4) ~f~0.offset)))) (or (= (select .cse0 (+ (* 4 v_subst_1) |c_ULTIMATE.start_main_#t~ret19#1.offset|)) 0) (< .cse1 0) (< c_~n_inv~0 (+ v_subst_1 1)) (not (= (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret19#1.offset| (* 4 .cse1))) c_~counter~0)) (< v_subst_1 0) (< c_~n~0 (+ .cse1 1)))))) is different from false [2024-05-03 11:33:41,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_116 (Array Int Int)) (~f~0.offset Int) (~f~0.base Int) (v_subst_1 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_117))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select (select .cse2 ~f~0.base) (+ (* c_~counter~0 4) ~f~0.offset)))) (or (= (select .cse0 (+ (* 4 v_subst_1) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 0) (< .cse1 0) (< c_~n_inv~0 (+ v_subst_1 1)) (not (= (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* 4 .cse1))) c_~counter~0)) (< v_subst_1 0) (< c_~n~0 (+ .cse1 1)))))) is different from false [2024-05-03 11:33:41,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:33:41,493 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:33:41,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:33:41,559 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 1228 treesize of output 1212 [2024-05-03 11:33:41,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:33:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 528 treesize of output 586 [2024-05-03 11:33:41,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:33:41,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 561 treesize of output 527 [2024-05-03 11:34:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 11:34:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276484050] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 11:34:49,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 11:34:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28, 25] total 55 [2024-05-03 11:34:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099517751] [2024-05-03 11:34:49,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 11:34:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-05-03 11:34:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 11:34:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-05-03 11:34:49,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2346, Unknown=28, NotChecked=206, Total=2970 [2024-05-03 11:34:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:34:49,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 11:34:49,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.345454545454546) internal successors, (404), 55 states have internal predecessors, (404), 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:34:49,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:34:49,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:34:49,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:34:49,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:34:49,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-03 11:34:49,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 11:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 11:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 11:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 11:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-03 11:34:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 11:34:51,414 INFO L78 Accepts]: Start accepts. Automaton has currently 230 states, but on-demand construction may add more states Word has length 168 [2024-05-03 11:34:51,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 11:34:51,425 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:34:51,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:34:51,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 11:34:51,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 11:34:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1393540960, now seen corresponding path program 3 times [2024-05-03 11:34:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 11:34:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735540033] [2024-05-03 11:34:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 11:34:51,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 11:34:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 11:34:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 11:34:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 11:34:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735540033] [2024-05-03 11:34:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735540033] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 11:34:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717116899] [2024-05-03 11:34:51,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 11:34:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:34:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 11:34:51,909 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:34:51,924 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:34:52,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-03 11:34:52,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 11:34:52,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-03 11:34:52,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 11:34:52,593 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 23 treesize of output 1 [2024-05-03 11:34:52,807 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:34:52,850 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:34:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-05-03 11:34:53,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 11:34:53,769 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~counter~0_138 Int) (~f~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int)) (~f~0.base Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (let ((.cse3 (select .cse4 ~f~0.base))) (let ((.cse0 (select .cse3 (+ (* v_~counter~0_138 4) ~f~0.offset))) (.cse2 (select .cse4 c_~f_inv~0.base)) (.cse1 (select .cse3 (+ (* c_~counter~0 4) ~f~0.offset)))) (or (< .cse0 0) (< c_~n_inv~0 (+ .cse1 1)) (< c_~n_inv~0 (+ .cse0 1)) (= (select .cse2 (+ (* .cse0 4) c_~f_inv~0.offset)) 0) (< .cse1 0) (not (= (select .cse2 (+ (* .cse1 4) c_~f_inv~0.offset)) c_~counter~0))))))) is different from false [2024-05-03 11:34:53,853 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~counter~0_138 Int) (~f~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int)) (~f~0.base Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (let ((.cse3 (select .cse4 ~f~0.base))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_#t~ret19#1.base|)) (.cse0 (select .cse3 (+ (* v_~counter~0_138 4) ~f~0.offset))) (.cse1 (select .cse3 (+ (* c_~counter~0 4) ~f~0.offset)))) (or (< .cse0 0) (< c_~n_inv~0 (+ .cse1 1)) (< c_~n_inv~0 (+ .cse0 1)) (not (= (select .cse2 (+ (* .cse1 4) |c_ULTIMATE.start_main_#t~ret19#1.offset|)) c_~counter~0)) (= (select .cse2 (+ (* .cse0 4) |c_ULTIMATE.start_main_#t~ret19#1.offset|)) 0) (< .cse1 0)))))) is different from false [2024-05-03 11:34:53,905 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~counter~0_138 Int) (~f~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int)) (~f~0.base Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (let ((.cse3 (select .cse4 ~f~0.base))) (let ((.cse0 (select .cse3 (+ (* v_~counter~0_138 4) ~f~0.offset))) (.cse2 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse1 (select .cse3 (+ (* c_~counter~0 4) ~f~0.offset)))) (or (< .cse0 0) (< c_~n_inv~0 (+ .cse1 1)) (< c_~n_inv~0 (+ .cse0 1)) (< .cse1 0) (= (select .cse2 (+ (* .cse0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 0) (not (= c_~counter~0 (select .cse2 (+ (* .cse1 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) is different from false [2024-05-03 11:34:53,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_~counter~0_138 Int) (~f~0.offset Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int)) (~f~0.base Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_155) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156))) (let ((.cse3 (select .cse4 ~f~0.base))) (let ((.cse1 (select .cse3 (+ (* c_~counter~0 4) ~f~0.offset))) (.cse2 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (select .cse3 (+ (* v_~counter~0_138 4) ~f~0.offset)))) (or (< .cse0 0) (< c_~n_inv~0 (+ .cse1 1)) (< c_~n_inv~0 (+ .cse0 1)) (< .cse1 0) (not (= c_~counter~0 (select .cse2 (+ (* .cse1 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= (select .cse2 (+ (* .cse0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0)))))) is different from false [2024-05-03 11:34:54,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:34:54,235 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 232 treesize of output 148 [2024-05-03 11:34:54,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:34:54,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 1960 treesize of output 2156 [2024-05-03 11:34:54,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:34:54,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 1119 treesize of output 1356 [2024-05-03 11:34:55,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 11:34:55,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 1294 treesize of output 1286 [2024-05-03 11:36:51,843 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:36:51,843 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:36:51,844 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-03 11:36:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-03 11:36:52,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 11:36:52,050 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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) ... 69 more [2024-05-03 11:36:52,065 INFO L158 Benchmark]: Toolchain (without parser) took 197281.60ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 80.9MB in the beginning and 532.6MB in the end (delta: -451.7MB). Peak memory consumption was 682.8MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,065 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 153.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 11:36:52,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.15ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 80.7MB in the beginning and 187.4MB in the end (delta: -106.7MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.20ms. Allocated memory is still 218.1MB. Free memory was 187.4MB in the beginning and 185.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,066 INFO L158 Benchmark]: Boogie Preprocessor took 38.73ms. Allocated memory is still 218.1MB. Free memory was 185.1MB in the beginning and 188.8MB in the end (delta: -3.6MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,066 INFO L158 Benchmark]: RCFGBuilder took 564.73ms. Allocated memory is still 218.1MB. Free memory was 188.8MB in the beginning and 153.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,066 INFO L158 Benchmark]: TraceAbstraction took 196338.57ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 152.1MB in the beginning and 532.6MB in the end (delta: -380.5MB). Peak memory consumption was 687.8MB. Max. memory is 8.0GB. [2024-05-03 11:36:52,067 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.38ms. Allocated memory is still 153.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.15ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 80.7MB in the beginning and 187.4MB in the end (delta: -106.7MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.20ms. Allocated memory is still 218.1MB. Free memory was 187.4MB in the beginning and 185.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.73ms. Allocated memory is still 218.1MB. Free memory was 185.1MB in the beginning and 188.8MB in the end (delta: -3.6MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. * RCFGBuilder took 564.73ms. Allocated memory is still 218.1MB. Free memory was 188.8MB in the beginning and 153.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 196338.57ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 152.1MB in the beginning and 532.6MB in the end (delta: -380.5MB). Peak memory consumption was 687.8MB. 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:36:52,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...