/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 14:21:40,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 14:21:40,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 14:21:40,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 14:21:40,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 14:21:40,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 14:21:40,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 14:21:40,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 14:21:40,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 14:21:40,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 14:21:40,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 14:21:40,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 14:21:40,339 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 14:21:40,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 14:21:40,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 14:21:40,340 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 14:21:40,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 14:21:40,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 14:21:40,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 14:21:40,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 14:21:40,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 14:21:40,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 14:21:40,344 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 14:21:40,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 14:21:40,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 14:21:40,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 14:21:40,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 14:21:40,345 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 14:21:40,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 14:21:40,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:21:40,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 14:21:40,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 14:21:40,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 14:21:40,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 14:21:40,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 14:21:40,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 14:21:40,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 14:21:40,348 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 14:21:40,348 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 14:21:40,348 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 14:21:40,348 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/UAutomizer-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: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 14:21:40,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 14:21:40,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 14:21:40,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 14:21:40,616 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 14:21:40,616 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 14:21:40,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 14:21:41,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 14:21:42,000 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 14:21:42,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 14:21:42,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d566b6a2/2e2e8c6288b44a93889b0845eedd769d/FLAGb4c14bef3 [2023-11-17 14:21:42,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d566b6a2/2e2e8c6288b44a93889b0845eedd769d [2023-11-17 14:21:42,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 14:21:42,031 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 14:21:42,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 14:21:42,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 14:21:42,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 14:21:42,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec074b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42, skipping insertion in model container [2023-11-17 14:21:42,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 14:21:42,202 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-17 14:21:42,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:21:42,219 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 14:21:42,237 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-17 14:21:42,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:21:42,247 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:21:42,247 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 14:21:42,253 INFO L206 MainTranslator]: Completed translation [2023-11-17 14:21:42,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42 WrapperNode [2023-11-17 14:21:42,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 14:21:42,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 14:21:42,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 14:21:42,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 14:21:42,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,291 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 14:21:42,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 14:21:42,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 14:21:42,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 14:21:42,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 14:21:42,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 14:21:42,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 14:21:42,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 14:21:42,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 14:21:42,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (1/1) ... [2023-11-17 14:21:42,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:21:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:42,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 14:21:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 14:21:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 14:21:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 14:21:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 14:21:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 14:21:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 14:21:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 14:21:42,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 14:21:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 14:21:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 14:21:42,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 14:21:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 14:21:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 14:21:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 14:21:42,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 14:21:42,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 14:21:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 14:21:42,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 14:21:42,415 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 14:21:42,498 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 14:21:42,500 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 14:21:42,805 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 14:21:43,021 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 14:21:43,022 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 14:21:43,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:21:43 BoogieIcfgContainer [2023-11-17 14:21:43,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 14:21:43,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 14:21:43,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 14:21:43,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 14:21:43,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:21:42" (1/3) ... [2023-11-17 14:21:43,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295d9544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:21:43, skipping insertion in model container [2023-11-17 14:21:43,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:21:42" (2/3) ... [2023-11-17 14:21:43,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295d9544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:21:43, skipping insertion in model container [2023-11-17 14:21:43,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:21:43" (3/3) ... [2023-11-17 14:21:43,036 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-17 14:21:43,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 14:21:43,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 14:21:43,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 14:21:43,053 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 14:21:43,113 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 14:21:43,157 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:21:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 14:21:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:43,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 14:21:43,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 14:21:43,211 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 14:21:43,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 14:21:43,226 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;@7d861b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:21:43,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 14:21:43,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:43,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 57407234, now seen corresponding path program 1 times [2023-11-17 14:21:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452611517] [2023-11-17 14:21:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 14:21:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452611517] [2023-11-17 14:21:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452611517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:21:43,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:21:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 14:21:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050635823] [2023-11-17 14:21:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:21:43,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:21:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:21:43,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:21:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:43,989 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:43,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:21:43,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:44,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 14:21:44,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:44,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -66489335, now seen corresponding path program 1 times [2023-11-17 14:21:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:44,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855761119] [2023-11-17 14:21:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:44,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:44,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855761119] [2023-11-17 14:21:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855761119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183229693] [2023-11-17 14:21:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:44,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:44,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:44,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:44,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 14:21:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:44,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:21:44,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:44,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:44,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183229693] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:44,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2023-11-17 14:21:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287522601] [2023-11-17 14:21:44,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:44,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 14:21:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 14:21:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-17 14:21:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:44,602 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:44,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:21:44,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:44,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:21:44,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 14:21:44,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-17 14:21:44,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:44,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2114696439, now seen corresponding path program 1 times [2023-11-17 14:21:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689749986] [2023-11-17 14:21:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689749986] [2023-11-17 14:21:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689749986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554532180] [2023-11-17 14:21:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:45,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:45,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 14:21:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:45,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 14:21:45,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:45,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:45,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554532180] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:21:45,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:21:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 14:21:45,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56841315] [2023-11-17 14:21:45,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:21:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 14:21:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:21:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 14:21:45,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 14:21:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:45,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:21:45,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 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) [2023-11-17 14:21:45,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:45,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:21:45,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:21:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:21:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:21:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:21:45,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 14:21:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:45,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:21:45,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:21:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1623234560, now seen corresponding path program 2 times [2023-11-17 14:21:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:21:45,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580009502] [2023-11-17 14:21:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:21:45,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:21:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:21:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:21:48,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:21:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580009502] [2023-11-17 14:21:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580009502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:21:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775046351] [2023-11-17 14:21:48,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:21:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:21:48,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:21:48,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:21:48,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 14:21:48,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:21:48,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:21:48,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-17 14:21:48,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:21:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:21:48,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-17 14:21:49,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:49,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 72 [2023-11-17 14:21:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:21:50,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:21:53,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (= c_~max1~0 c_~max3~0)) (.cse26 (= c_~max1~0 c_~max2~0)) (.cse13 (+ c_~max1~0 1)) (.cse4 (+ c_~max2~0 1)) (.cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse6 (+ .cse66 c_~A~0.offset)) (.cse12 (+ c_~max3~0 1)) (.cse2 (+ .cse66 c_~A~0.offset 4))) (and (or .cse0 (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse6))) (or (< c_~max3~0 (select .cse1 .cse2)) (< .cse3 .cse4) (< c_~max1~0 (select .cse1 .cse5)) (= c_~max1~0 .cse3))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse6))) (or (< c_~max3~0 (+ .cse7 1)) (< c_~max3~0 (select .cse8 .cse2)) (< .cse7 .cse4) (< c_~max1~0 (select .cse8 .cse5)))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse9 (select .cse14 .cse2)) (.cse10 (select .cse14 .cse5)) (.cse11 (select .cse14 .cse6))) (or (= .cse9 .cse10) (< .cse11 .cse4) (< .cse9 .cse12) (< .cse10 .cse13) (= .cse10 .cse11))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6)) (.cse17 (select .cse16 .cse2))) (or (< .cse15 .cse4) (< c_~max1~0 (select .cse16 .cse5)) (< .cse17 .cse12) (= c_~max1~0 .cse15) (< .cse15 .cse17))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse6))) (or (< c_~max3~0 (select .cse18 .cse2)) (< .cse19 .cse4) (< c_~max1~0 (select .cse18 .cse5)) (< .cse19 c_~max3~0) (= c_~max1~0 .cse19))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse5))) (or (< c_~max3~0 (select .cse20 .cse2)) (< c_~max2~0 (select .cse20 .cse6)) (< .cse21 .cse13) (= .cse21 c_~max3~0) (= .cse21 c_~max2~0))))) (or (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse23 (select .cse22 .cse2))) (or (< c_~max1~0 (select .cse22 .cse5)) (< c_~max2~0 .cse23) (< c_~max2~0 (select .cse22 .cse6)) (< .cse23 .cse12))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse25 (select .cse24 .cse2))) (or (< c_~max1~0 (select .cse24 .cse5)) (< c_~max2~0 (select .cse24 .cse6)) (< .cse25 .cse12) (= .cse25 c_~max1~0)))))) .cse26) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse28 (select .cse30 .cse5)) (.cse27 (select .cse30 .cse2)) (.cse29 (select .cse30 .cse6))) (or (= .cse27 .cse28) (< .cse29 .cse4) (< .cse27 .cse12) (< .cse28 .cse13) (< .cse27 (+ .cse29 1)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse6)) (.cse33 (select .cse32 .cse2))) (or (< .cse31 .cse4) (< c_~max1~0 (select .cse32 .cse5)) (< .cse33 .cse12) (= c_~max1~0 .cse31) (= .cse33 c_~max1~0))))) (or (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse35 (select .cse34 .cse5))) (or (< c_~max3~0 (select .cse34 .cse2)) (< c_~max2~0 (select .cse34 .cse6)) (< .cse35 .cse13) (= .cse35 c_~max3~0))))) (< c_~max3~0 .cse4)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse2)) (.cse38 (select .cse39 .cse5)) (.cse36 (select .cse39 .cse6))) (or (< .cse36 .cse4) (< .cse37 .cse12) (< .cse38 .cse13) (< .cse36 .cse37) (= .cse38 .cse36))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse41 (select .cse40 .cse6)) (.cse42 (select .cse40 .cse5))) (or (< c_~max3~0 (select .cse40 .cse2)) (< .cse41 .cse4) (< .cse42 .cse13) (= .cse42 .cse41) (= .cse42 c_~max3~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse43 (select .cse45 .cse2)) (.cse44 (select .cse45 .cse5))) (or (= .cse43 .cse44) (< .cse43 .cse4) (< c_~max2~0 (select .cse45 .cse6)) (< .cse43 .cse12) (< .cse44 .cse13))))) (or (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse47 (select .cse46 .cse5))) (or (< c_~max3~0 (select .cse46 .cse2)) (< c_~max2~0 (select .cse46 .cse6)) (< .cse47 .cse13) (= .cse47 c_~max2~0))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse48 (select .cse49 .cse2)) (.cse50 (select .cse49 .cse5))) (or (< c_~max2~0 .cse48) (< c_~max2~0 (select .cse49 .cse6)) (< .cse48 .cse12) (< .cse50 .cse13) (= .cse50 c_~max2~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse53 (select .cse51 .cse5)) (.cse52 (select .cse51 .cse6))) (or (< c_~max3~0 (select .cse51 .cse2)) (< .cse52 .cse4) (< .cse53 .cse13) (< .cse52 c_~max3~0) (= .cse53 .cse52))))) (or (and .cse0 (<= .cse4 c_~max3~0)) (and .cse26 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (or (< c_~max3~0 (select .cse54 .cse2)) (< c_~max1~0 (select .cse54 .cse5)) (< c_~max2~0 (select .cse54 .cse6)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse55 (select .cse57 .cse2)) (.cse56 (select .cse57 .cse5))) (or (= .cse55 .cse56) (< c_~max2~0 (select .cse57 .cse6)) (< .cse55 .cse12) (< .cse56 .cse13) (= .cse56 c_~max2~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse60 (select .cse59 .cse2)) (.cse58 (select .cse59 .cse6))) (or (< .cse58 .cse4) (< c_~max1~0 (select .cse59 .cse5)) (< .cse60 .cse12) (= .cse60 c_~max1~0) (< .cse60 (+ .cse58 1)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse62 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse61 (select .cse62 .cse6)) (.cse63 (select .cse62 .cse5))) (or (< c_~max3~0 (+ .cse61 1)) (< c_~max3~0 (select .cse62 .cse2)) (< .cse61 .cse4) (< .cse63 .cse13) (= .cse63 c_~max3~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse64 (select .cse65 .cse2))) (or (< .cse64 .cse4) (< c_~max1~0 (select .cse65 .cse5)) (< c_~max2~0 (select .cse65 .cse6)) (< .cse64 .cse12) (= .cse64 c_~max1~0)))))))) is different from false [2023-11-17 14:21:54,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (= c_~max1~0 c_~max3~0)) (.cse18 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~max1~0 1)) (.cse1 (+ c_~max3~0 1)) (.cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4)) (.cse4 (+ c_~max2~0 1)) (.cse6 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse2 (select .cse5 .cse7)) (.cse0 (select .cse5 .cse6))) (or (< .cse0 .cse1) (= .cse2 .cse0) (< .cse2 .cse3) (< .cse0 .cse4) (< c_~max2~0 (select .cse5 c_~A~0.offset)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse9 (select .cse10 c_~A~0.offset)) (.cse8 (select .cse10 .cse7))) (or (< .cse8 .cse3) (< .cse9 .cse4) (< c_~max3~0 (+ .cse9 1)) (< c_~max3~0 (select .cse10 .cse6)) (= .cse8 c_~max3~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset))) (or (< .cse11 c_~max3~0) (< c_~max1~0 (select .cse12 .cse7)) (< .cse11 .cse4) (< c_~max3~0 (select .cse12 .cse6)) (= c_~max1~0 .cse11))))) (or .cse13 (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< c_~max1~0 (select .cse14 .cse7)) (< .cse15 .cse4) (< c_~max3~0 (+ .cse15 1)) (< c_~max3~0 (select .cse14 .cse6)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse17 (select .cse16 c_~A~0.offset))) (or (< c_~max1~0 (select .cse16 .cse7)) (< .cse17 .cse4) (< c_~max3~0 (select .cse16 .cse6)) (= c_~max1~0 .cse17))))))) (or .cse18 (and (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse6))) (or (< c_~max2~0 .cse19) (< .cse19 .cse1) (< c_~max1~0 (select .cse20 .cse7)) (< c_~max2~0 (select .cse20 c_~A~0.offset)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse6))) (or (< .cse21 .cse1) (< c_~max1~0 (select .cse22 .cse7)) (= c_~max1~0 .cse21) (< c_~max2~0 (select .cse22 c_~A~0.offset)))))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse24 (select .cse26 .cse7)) (.cse25 (select .cse26 c_~A~0.offset)) (.cse23 (select .cse26 .cse6))) (or (< .cse23 .cse1) (= .cse24 .cse25) (< .cse24 .cse3) (< .cse25 .cse4) (< .cse25 .cse23))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse27 (select .cse29 .cse6)) (.cse28 (select .cse29 .cse7))) (or (< c_~max2~0 .cse27) (< .cse27 .cse1) (< .cse28 .cse3) (< c_~max2~0 (select .cse29 c_~A~0.offset)) (= .cse28 c_~max2~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse6))) (or (< .cse30 .cse1) (< c_~max1~0 (select .cse31 .cse7)) (= c_~max1~0 .cse30) (< .cse30 .cse4) (< c_~max2~0 (select .cse31 c_~A~0.offset)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse7)) (.cse32 (select .cse34 c_~A~0.offset))) (or (< .cse32 c_~max3~0) (= .cse33 .cse32) (< .cse33 .cse3) (< .cse32 .cse4) (< c_~max3~0 (select .cse34 .cse6)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse7))) (or (< .cse35 .cse3) (< c_~max3~0 (select .cse36 .cse6)) (= .cse35 c_~max3~0) (< c_~max2~0 (select .cse36 c_~A~0.offset)) (= .cse35 c_~max2~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse37 (select .cse38 .cse6)) (.cse39 (select .cse38 c_~A~0.offset))) (or (< .cse37 .cse1) (< c_~max1~0 (select .cse38 .cse7)) (< .cse39 .cse4) (= c_~max1~0 .cse37) (< .cse37 (+ .cse39 1)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse6)) (.cse42 (select .cse41 c_~A~0.offset))) (or (< .cse40 .cse1) (< c_~max1~0 (select .cse41 .cse7)) (< .cse42 .cse4) (= c_~max1~0 .cse40) (= c_~max1~0 .cse42))))) (or (and .cse13 (<= .cse4 c_~max3~0)) (and .cse18 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (or (< c_~max1~0 (select .cse43 .cse7)) (< c_~max3~0 (select .cse43 .cse6)) (< c_~max2~0 (select .cse43 c_~A~0.offset)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse44 (select .cse47 .cse6)) (.cse45 (select .cse47 .cse7)) (.cse46 (select .cse47 c_~A~0.offset))) (or (< .cse44 .cse1) (= .cse45 .cse44) (= .cse45 .cse46) (< .cse45 .cse3) (< .cse46 .cse4))))) (or (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse48 (select .cse49 .cse7))) (or (< .cse48 .cse3) (< c_~max3~0 (select .cse49 .cse6)) (= .cse48 c_~max3~0) (< c_~max2~0 (select .cse49 c_~A~0.offset)))))) (< c_~max3~0 .cse4)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse51 (select .cse52 c_~A~0.offset)) (.cse50 (select .cse52 .cse7))) (or (= .cse50 .cse51) (< .cse50 .cse3) (< .cse51 .cse4) (< c_~max3~0 (select .cse52 .cse6)) (= .cse50 c_~max3~0))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse56 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse54 (select .cse56 .cse7)) (.cse53 (select .cse56 .cse6)) (.cse55 (select .cse56 c_~A~0.offset))) (or (< .cse53 .cse1) (= .cse54 .cse53) (< .cse54 .cse3) (< .cse55 .cse4) (< .cse53 (+ .cse55 1)))))) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse57 (select .cse59 .cse6)) (.cse58 (select .cse59 .cse7))) (or (< .cse57 .cse1) (= .cse58 .cse57) (< .cse58 .cse3) (< c_~max2~0 (select .cse59 c_~A~0.offset)) (= .cse58 c_~max2~0))))) (or (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse60 (select .cse61 .cse7))) (or (< .cse60 .cse3) (< c_~max3~0 (select .cse61 .cse6)) (< c_~max2~0 (select .cse61 c_~A~0.offset)) (= .cse60 c_~max2~0))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_119 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_119) c_~A~0.base))) (let ((.cse62 (select .cse63 .cse6)) (.cse64 (select .cse63 c_~A~0.offset))) (or (< .cse62 .cse1) (< c_~max1~0 (select .cse63 .cse7)) (< .cse64 .cse4) (< .cse64 .cse62) (= c_~max1~0 .cse64))))))) is different from false [2023-11-17 14:21:54,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,477 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 3019 treesize of output 2307 [2023-11-17 14:21:54,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2225 treesize of output 2227 [2023-11-17 14:21:54,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2208 treesize of output 2210 [2023-11-17 14:21:54,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2191 treesize of output 2186 [2023-11-17 14:21:54,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:54,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2167 treesize of output 2162 [2023-11-17 14:21:55,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2143 treesize of output 2140 [2023-11-17 14:21:55,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2121 treesize of output 2125 [2023-11-17 14:21:55,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2106 treesize of output 2098 [2023-11-17 14:21:55,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2079 treesize of output 2085 [2023-11-17 14:21:55,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2066 treesize of output 2064 [2023-11-17 14:21:55,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2045 treesize of output 2043 [2023-11-17 14:21:55,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2024 treesize of output 2026 [2023-11-17 14:21:55,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2007 treesize of output 2003 [2023-11-17 14:21:55,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:55,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1984 treesize of output 1970 [2023-11-17 14:21:56,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1951 treesize of output 1940 [2023-11-17 14:21:56,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1921 treesize of output 1920 [2023-11-17 14:21:56,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1901 treesize of output 1889 [2023-11-17 14:21:56,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1870 treesize of output 1874 [2023-11-17 14:21:56,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1855 treesize of output 1855 [2023-11-17 14:21:56,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1836 treesize of output 1826 [2023-11-17 14:21:56,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1807 treesize of output 1798 [2023-11-17 14:21:56,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:56,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1779 treesize of output 1778 [2023-11-17 14:21:57,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:21:57,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1759 treesize of output 1750 [2023-11-17 14:25:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 14:25:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775046351] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:25:15,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:25:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 46 [2023-11-17 14:25:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290299351] [2023-11-17 14:25:15,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:25:15,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-17 14:25:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:25:15,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-17 14:25:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1828, Unknown=2, NotChecked=174, Total=2162 [2023-11-17 14:25:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:15,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:25:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 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) [2023-11-17 14:25:15,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:15,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:15,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:15,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:25:18,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 14:25:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:19,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:25:19,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:25:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash 849805351, now seen corresponding path program 3 times [2023-11-17 14:25:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:25:19,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885102993] [2023-11-17 14:25:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:25:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:25:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:25:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 14:25:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:25:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885102993] [2023-11-17 14:25:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885102993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:25:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511000879] [2023-11-17 14:25:19,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 14:25:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:25:19,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:25:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 14:25:19,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 14:25:19,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:25:19,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 14:25:19,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:25:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 14:25:19,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:25:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-17 14:25:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511000879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:25:20,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:25:20,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2023-11-17 14:25:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379127757] [2023-11-17 14:25:20,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:25:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 14:25:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:25:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 14:25:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2023-11-17 14:25:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:20,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:25:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:25:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:25:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:25:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 14:25:20,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 14:25:20,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:20,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:25:20,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:25:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash -373370881, now seen corresponding path program 4 times [2023-11-17 14:25:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:25:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183289214] [2023-11-17 14:25:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:25:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:25:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:25:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 14:25:20,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:25:20,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183289214] [2023-11-17 14:25:20,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183289214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:25:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671558805] [2023-11-17 14:25:20,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 14:25:20,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:25:20,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:25:20,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 14:25:20,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 14:25:20,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:25:20,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 14:25:20,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:25:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 14:25:21,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:25:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 14:25:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671558805] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:25:21,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:25:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2023-11-17 14:25:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601772825] [2023-11-17 14:25:21,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:25:21,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-17 14:25:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:25:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-17 14:25:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2023-11-17 14:25:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:21,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 14:25:21,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 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) [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-17 14:25:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:25:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:25:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:25:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 14:25:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:25:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 14:25:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 14:25:22,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 14:25:22,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:22,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 14:25:22,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:25:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 453873280, now seen corresponding path program 5 times [2023-11-17 14:25:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:25:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168790129] [2023-11-17 14:25:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:25:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:25:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:25:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:25:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:25:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168790129] [2023-11-17 14:25:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168790129] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:25:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183499560] [2023-11-17 14:25:30,941 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 14:25:30,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:25:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:25:30,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:25:30,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 14:25:31,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-17 14:25:31,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:25:31,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-17 14:25:31,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:25:31,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:25:31,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-11-17 14:25:39,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:25:39,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 582 treesize of output 262 [2023-11-17 14:25:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 14:25:40,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:28:06,707 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 14:28:06,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-11-17 14:28:06,709 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 14:28:06,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 14:28:06,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:28:06,910 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/UAutomizer-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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) 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:108) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) ... 46 more [2023-11-17 14:28:06,913 INFO L158 Benchmark]: Toolchain (without parser) took 384881.65ms. Allocated memory was 202.4MB in the beginning and 735.1MB in the end (delta: 532.7MB). Free memory was 152.5MB in the beginning and 364.9MB in the end (delta: -212.4MB). Peak memory consumption was 322.0MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,913 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 14:28:06,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.32ms. Allocated memory is still 202.4MB. Free memory was 152.2MB in the beginning and 140.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.85ms. Allocated memory is still 202.4MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,914 INFO L158 Benchmark]: Boogie Preprocessor took 44.67ms. Allocated memory is still 202.4MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,914 INFO L158 Benchmark]: RCFGBuilder took 686.18ms. Allocated memory was 202.4MB in the beginning and 290.5MB in the end (delta: 88.1MB). Free memory was 136.8MB in the beginning and 238.9MB in the end (delta: -102.1MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,915 INFO L158 Benchmark]: TraceAbstraction took 383885.79ms. Allocated memory was 290.5MB in the beginning and 735.1MB in the end (delta: 444.6MB). Free memory was 237.8MB in the beginning and 364.9MB in the end (delta: -127.1MB). Peak memory consumption was 317.7MB. Max. memory is 8.0GB. [2023-11-17 14:28:06,916 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.10ms. Allocated memory is still 202.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.32ms. Allocated memory is still 202.4MB. Free memory was 152.2MB in the beginning and 140.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.85ms. Allocated memory is still 202.4MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.67ms. Allocated memory is still 202.4MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 686.18ms. Allocated memory was 202.4MB in the beginning and 290.5MB in the end (delta: 88.1MB). Free memory was 136.8MB in the beginning and 238.9MB in the end (delta: -102.1MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. * TraceAbstraction took 383885.79ms. Allocated memory was 290.5MB in the beginning and 735.1MB in the end (delta: 444.6MB). Free memory was 237.8MB in the beginning and 364.9MB in the end (delta: -127.1MB). Peak memory consumption was 317.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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/UAutomizer-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. [2023-11-17 14:28:06,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...