/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 09:19:18,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 09:19:19,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 09:19:19,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 09:19:19,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 09:19:19,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 09:19:19,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 09:19:19,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 09:19:19,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 09:19:19,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 09:19:19,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 09:19:19,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 09:19:19,067 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 09:19:19,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 09:19:19,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 09:19:19,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 09:19:19,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 09:19:19,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 09:19:19,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 09:19:19,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 09:19:19,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 09:19:19,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 09:19:19,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-05 09:19:19,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 09:19:19,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 09:19:19,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 09:19:19,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 09:19:19,358 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 09:19:19,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-04-05 09:19:20,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 09:19:20,722 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 09:19:20,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-04-05 09:19:20,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1e0e67daf/cc80e26ccabe421d8db9c399f3ee7fa9/FLAG912c8235e [2024-04-05 09:19:20,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1e0e67daf/cc80e26ccabe421d8db9c399f3ee7fa9 [2024-04-05 09:19:20,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 09:19:20,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 09:19:20,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 09:19:20,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 09:19:20,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 09:19:20,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:20,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d77d06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20, skipping insertion in model container [2024-04-05 09:19:20,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:20,779 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 09:19:20,906 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-vector-add.wvr.c[2598,2611] [2024-04-05 09:19:20,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 09:19:20,943 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 09:19:20,963 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-vector-add.wvr.c[2598,2611] [2024-04-05 09:19:20,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 09:19:20,980 INFO L206 MainTranslator]: Completed translation [2024-04-05 09:19:20,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20 WrapperNode [2024-04-05 09:19:20,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 09:19:20,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 09:19:20,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 09:19:20,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 09:19:20,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,023 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 203 [2024-04-05 09:19:21,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 09:19:21,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 09:19:21,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 09:19:21,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 09:19:21,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 09:19:21,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 09:19:21,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 09:19:21,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 09:19:21,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (1/1) ... [2024-04-05 09:19:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 09:19:21,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 09:19:21,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 09:19:21,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 09:19:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 09:19:21,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 09:19:21,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-05 09:19:21,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 09:19:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 09:19:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 09:19:21,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 09:19:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 09:19:21,177 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 09:19:21,270 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 09:19:21,272 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 09:19:21,588 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 09:19:21,606 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 09:19:21,606 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-04-05 09:19:21,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:19:21 BoogieIcfgContainer [2024-04-05 09:19:21,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 09:19:21,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 09:19:21,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 09:19:21,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 09:19:21,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 09:19:20" (1/3) ... [2024-04-05 09:19:21,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1b18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:19:21, skipping insertion in model container [2024-04-05 09:19:21,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 09:19:20" (2/3) ... [2024-04-05 09:19:21,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1b18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 09:19:21, skipping insertion in model container [2024-04-05 09:19:21,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 09:19:21" (3/3) ... [2024-04-05 09:19:21,613 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-04-05 09:19:21,619 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 09:19:21,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 09:19:21,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 09:19:21,628 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 09:19:21,698 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 09:19:21,733 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 09:19:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 09:19:21,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 09:19:21,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 09:19:21,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 09:19:21,760 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 09:19:21,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 09:19:21,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 09:19:21,775 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;@6b5d73b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-05 09:19:21,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 09:19:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1462143548, now seen corresponding path program 1 times [2024-04-05 09:19:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 09:19:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 09:19:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 09:19:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 09:19:24,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2115104969, now seen corresponding path program 1 times [2024-04-05 09:19:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 09:19:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 09:19:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 09:19:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-04-05 09:19:26,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1930 treesize of output 1834 [2024-04-05 09:19:26,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 924 [2024-04-05 09:19:26,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 952 treesize of output 904 [2024-04-05 09:19:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -652909766, now seen corresponding path program 1 times [2024-04-05 09:19:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:27,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:27,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1050467796, now seen corresponding path program 1 times [2024-04-05 09:19:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:28,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 276100335, now seen corresponding path program 1 times [2024-04-05 09:19:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:29,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash 676955722, now seen corresponding path program 2 times [2024-04-05 09:19:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:29,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1317981819, now seen corresponding path program 3 times [2024-04-05 09:19:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 924 [2024-04-05 09:19:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash 481407604, now seen corresponding path program 4 times [2024-04-05 09:19:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:30,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1400289585, now seen corresponding path program 5 times [2024-04-05 09:19:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:31,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:31,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1603935782, now seen corresponding path program 6 times [2024-04-05 09:19:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:31,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1536109092, now seen corresponding path program 7 times [2024-04-05 09:19:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:32,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 374742332, now seen corresponding path program 8 times [2024-04-05 09:19:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 09:19:33,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash -992111836, now seen corresponding path program 9 times [2024-04-05 09:19:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:33,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1930 treesize of output 1834 [2024-04-05 09:19:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1426103381, now seen corresponding path program 10 times [2024-04-05 09:19:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:33,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1982832780, now seen corresponding path program 11 times [2024-04-05 09:19:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 09:19:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash 798739494, now seen corresponding path program 1 times [2024-04-05 09:19:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-05 09:19:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-05 09:19:35,030 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)] === [2024-04-05 09:19:35,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 09:19:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -566126889, now seen corresponding path program 1 times [2024-04-05 09:19:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 09:19:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198211890] [2024-04-05 09:19:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 09:19:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 09:19:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198211890] [2024-04-05 09:19:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198211890] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 09:19:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620181651] [2024-04-05 09:19:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 09:19:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 09:19:35,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 09:19:35,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 09:19:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:35,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 10 conjunts are in the unsatisfiable core [2024-04-05 09:19:35,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 09:19:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 09:19:35,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 09:19:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 09:19:36,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620181651] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 09:19:36,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 09:19:36,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-04-05 09:19:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344375402] [2024-04-05 09:19:36,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 09:19:36,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-04-05 09:19:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 09:19:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-04-05 09:19:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-04-05 09:19:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 09:19:36,295 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 09:19:36,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.96) internal successors, (374), 25 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 09:19:36,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 09:19:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:37,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:39,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 924 [2024-04-05 09:19:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 381753679, now seen corresponding path program 12 times [2024-04-05 09:19:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:40,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash 143247303, now seen corresponding path program 13 times [2024-04-05 09:19:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:40,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 715070320, now seen corresponding path program 14 times [2024-04-05 09:19:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:43,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1663765830, now seen corresponding path program 15 times [2024-04-05 09:19:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:44,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1568431986, now seen corresponding path program 16 times [2024-04-05 09:19:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:45,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:45,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 952 treesize of output 904 [2024-04-05 09:19:47,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1930 treesize of output 1834 [2024-04-05 09:19:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1134896115, now seen corresponding path program 17 times [2024-04-05 09:19:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:48,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1494412801, now seen corresponding path program 18 times [2024-04-05 09:19:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:48,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 952 treesize of output 904 [2024-04-05 09:19:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash -917842689, now seen corresponding path program 19 times [2024-04-05 09:19:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:49,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 924 [2024-04-05 09:19:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 6835362, now seen corresponding path program 20 times [2024-04-05 09:19:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2079220960, now seen corresponding path program 21 times [2024-04-05 09:19:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 09:19:50,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 188955433, now seen corresponding path program 2 times [2024-04-05 09:19:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 09:19:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:51,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 09:19:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 09:19:52,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-05 09:19:52,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable51,SelfDestructingSolverStorable41,SelfDestructingSolverStorable52,SelfDestructingSolverStorable42,SelfDestructingSolverStorable53,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable54,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39 [2024-04-05 09:19:52,940 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)] === [2024-04-05 09:19:52,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 09:19:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1964987494, now seen corresponding path program 2 times [2024-04-05 09:19:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 09:19:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509868737] [2024-04-05 09:19:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:52,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:19:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 174 proven. 220 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 09:19:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 09:19:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509868737] [2024-04-05 09:19:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509868737] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 09:19:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723867132] [2024-04-05 09:19:54,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 09:19:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 09:19:54,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 09:19:54,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 09:19:54,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 09:19:54,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 09:19:54,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 09:19:54,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 14 conjunts are in the unsatisfiable core [2024-04-05 09:19:54,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 09:19:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 129 proven. 19 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-04-05 09:19:55,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 09:19:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-04-05 09:19:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723867132] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 09:19:55,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 09:19:55,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 63 [2024-04-05 09:19:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084574067] [2024-04-05 09:19:55,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 09:19:55,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-04-05 09:19:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 09:19:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-04-05 09:19:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3590, Unknown=0, NotChecked=0, Total=3906 [2024-04-05 09:19:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 09:19:55,849 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 09:19:55,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 8.777777777777779) internal successors, (553), 63 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 09:19:55,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 09:19:55,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 09:19:57,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 449 [2024-04-05 09:19:59,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:19:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -464758629, now seen corresponding path program 1 times [2024-04-05 09:19:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 09:19:59,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 09:19:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 09:19:59,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1930 treesize of output 1834 [2024-04-05 09:19:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1169210278, now seen corresponding path program 1 times [2024-04-05 09:19:59,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:19:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:19:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-04-05 09:20:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-04-05 09:20:00,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 09:20:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4315, Unknown=0, NotChecked=0, Total=4556 [2024-04-05 09:20:00,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:20:01,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:20:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash -666480591, now seen corresponding path program 22 times [2024-04-05 09:20:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 09:20:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 09:20:02,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2024-04-05 09:20:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1968605377, now seen corresponding path program 23 times [2024-04-05 09:20:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 09:20:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 09:20:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 924 [2024-04-05 09:20:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -766616907, now seen corresponding path program 24 times [2024-04-05 09:20:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-04-05 09:20:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 09:20:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 09:20:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 09:20:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-04-05 09:20:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 09:20:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable55,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-04-05 09:20:06,307 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@33e662a9 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) 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) [2024-04-05 09:20:06,311 INFO L158 Benchmark]: Toolchain (without parser) took 45563.86ms. Allocated memory was 271.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 201.7MB in the beginning and 865.0MB in the end (delta: -663.3MB). Peak memory consumption was 681.7MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,311 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 65.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 09:20:06,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.08ms. Allocated memory is still 271.6MB. Free memory was 201.5MB in the beginning and 240.0MB in the end (delta: -38.4MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.77ms. Allocated memory is still 271.6MB. Free memory was 240.0MB in the beginning and 237.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,312 INFO L158 Benchmark]: Boogie Preprocessor took 37.07ms. Allocated memory is still 271.6MB. Free memory was 237.3MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,312 INFO L158 Benchmark]: RCFGBuilder took 545.86ms. Allocated memory is still 271.6MB. Free memory was 235.2MB in the beginning and 211.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,312 INFO L158 Benchmark]: TraceAbstraction took 44700.95ms. Allocated memory was 271.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 210.1MB in the beginning and 865.0MB in the end (delta: -654.9MB). Peak memory consumption was 688.5MB. Max. memory is 8.0GB. [2024-04-05 09:20:06,313 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.11ms. Allocated memory is still 163.6MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 65.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.08ms. Allocated memory is still 271.6MB. Free memory was 201.5MB in the beginning and 240.0MB in the end (delta: -38.4MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.77ms. Allocated memory is still 271.6MB. Free memory was 240.0MB in the beginning and 237.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.07ms. Allocated memory is still 271.6MB. Free memory was 237.3MB in the beginning and 235.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 545.86ms. Allocated memory is still 271.6MB. Free memory was 235.2MB in the beginning and 211.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 44700.95ms. Allocated memory was 271.6MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 210.1MB in the beginning and 865.0MB in the end (delta: -654.9MB). Peak memory consumption was 688.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@33e662a9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@33e662a9: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 09:20:06,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 09:20:06,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...