/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 20:20:45,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 20:20:45,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 20:20:45,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 20:20:45,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 20:20:45,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 20:20:45,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 20:20:45,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 20:20:45,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 20:20:45,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 20:20:45,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 20:20:45,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 20:20:45,347 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 20:20:45,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 20:20:45,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 20:20:45,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 20:20:45,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 20:20:45,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 20:20:45,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 20:20:45,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 20:20:45,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 20:20:45,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 20:20:45,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 20:20:45,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 20:20:45,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 20:20:45,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 20:20:45,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 20:20:45,351 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 20:20:45,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 20:20:45,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 20:20:45,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 20:20:45,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 20:20:45,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 20:20:45,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 20:20:45,353 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 20:20:45,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 20:20:45,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 20:20:45,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 20:20:45,354 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 20:20:45,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 20:20:45,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 20:20:45,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 20:20:45,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 20:20:45,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 20:20:45,622 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 20:20:45,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-05-30 20:20:46,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 20:20:46,908 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 20:20:46,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2024-05-30 20:20:46,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5c41b27f3/fcf38286c24a4a0da3478fb15ab0a3f1/FLAG76ff114e1 [2024-05-30 20:20:46,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5c41b27f3/fcf38286c24a4a0da3478fb15ab0a3f1 [2024-05-30 20:20:46,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 20:20:46,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 20:20:46,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 20:20:46,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 20:20:46,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 20:20:46,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 08:20:46" (1/1) ... [2024-05-30 20:20:46,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b310653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:46, skipping insertion in model container [2024-05-30 20:20:46,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 08:20:46" (1/1) ... [2024-05-30 20:20:46,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 20:20:47,150 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2024-05-30 20:20:47,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 20:20:47,167 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 20:20:47,196 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2024-05-30 20:20:47,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 20:20:47,216 INFO L206 MainTranslator]: Completed translation [2024-05-30 20:20:47,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47 WrapperNode [2024-05-30 20:20:47,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 20:20:47,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 20:20:47,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 20:20:47,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 20:20:47,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,261 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 208 [2024-05-30 20:20:47,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 20:20:47,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 20:20:47,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 20:20:47,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 20:20:47,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 20:20:47,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 20:20:47,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 20:20:47,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 20:20:47,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (1/1) ... [2024-05-30 20:20:47,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 20:20:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:20:47,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 20:20:47,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 20:20:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 20:20:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 20:20:47,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 20:20:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 20:20:47,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 20:20:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 20:20:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 20:20:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 20:20:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 20:20:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 20:20:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 20:20:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 20:20:47,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 20:20:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 20:20:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 20:20:47,414 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 20:20:47,518 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 20:20:47,520 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 20:20:47,782 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 20:20:47,904 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 20:20:47,904 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 20:20:47,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 08:20:47 BoogieIcfgContainer [2024-05-30 20:20:47,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 20:20:47,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 20:20:47,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 20:20:47,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 20:20:47,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 08:20:46" (1/3) ... [2024-05-30 20:20:47,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a45f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 08:20:47, skipping insertion in model container [2024-05-30 20:20:47,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 08:20:47" (2/3) ... [2024-05-30 20:20:47,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a45f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 08:20:47, skipping insertion in model container [2024-05-30 20:20:47,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 08:20:47" (3/3) ... [2024-05-30 20:20:47,912 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-05-30 20:20:47,921 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 20:20:47,930 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 20:20:47,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 20:20:47,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 20:20:48,000 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 20:20:48,054 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:20:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 20:20:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:20:48,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 20:20:48,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 20:20:48,108 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 20:20:48,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 20:20:48,122 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;@385aa3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:20:48,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 20:20:48,243 INFO L78 Accepts]: Start accepts. Automaton has currently 230 states, but on-demand construction may add more states Word has length 147 [2024-05-30 20:20:48,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:20:48,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:20:48,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:20:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1494298732, now seen corresponding path program 1 times [2024-05-30 20:20:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:20:48,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140399477] [2024-05-30 20:20:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:20:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:20:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:20:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 20:20:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:20:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140399477] [2024-05-30 20:20:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140399477] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:20:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:20:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 20:20:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432933417] [2024-05-30 20:20:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:20:48,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 20:20:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:20:48,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 20:20:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 20:20:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:48,575 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:20:48,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:20:48,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:48,623 INFO L78 Accepts]: Start accepts. Automaton has currently 230 states, but on-demand construction may add more states Word has length 142 [2024-05-30 20:20:48,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:20:48,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 20:20:48,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:20:48,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:20:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 552113086, now seen corresponding path program 1 times [2024-05-30 20:20:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:20:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103943410] [2024-05-30 20:20:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:20:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:20:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:20:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:20:49,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:20:49,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103943410] [2024-05-30 20:20:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103943410] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:20:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:20:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 20:20:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527894255] [2024-05-30 20:20:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:20:49,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 20:20:49,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:20:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 20:20:49,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 20:20:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,231 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:20:49,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:20:49,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:20:49,418 INFO L78 Accepts]: Start accepts. Automaton has currently 238 states, but on-demand construction may add more states Word has length 150 [2024-05-30 20:20:49,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:20:49,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 20:20:49,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:20:49,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:20:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2012218894, now seen corresponding path program 1 times [2024-05-30 20:20:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:20:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695632313] [2024-05-30 20:20:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:20:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:20:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:20:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 20:20:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:20:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695632313] [2024-05-30 20:20:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695632313] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:20:49,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:20:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 20:20:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426513566] [2024-05-30 20:20:49,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:20:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 20:20:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:20:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 20:20:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 20:20:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:20:49,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:20:49,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:20:49,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:20:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:20:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:20:49,830 INFO L78 Accepts]: Start accepts. Automaton has currently 246 states, but on-demand construction may add more states Word has length 158 [2024-05-30 20:20:49,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:20:49,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 20:20:49,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:20:49,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:20:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -794940406, now seen corresponding path program 1 times [2024-05-30 20:20:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:20:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483148000] [2024-05-30 20:20:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:20:49,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:20:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:20:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:20:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:20:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483148000] [2024-05-30 20:20:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483148000] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:20:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822612497] [2024-05-30 20:20:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:20:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:20:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:20:54,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:20:54,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 20:20:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:20:54,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 59 conjunts are in the unsatisfiable core [2024-05-30 20:20:54,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:20:58,106 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-30 20:20:58,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-05-30 20:20:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:20:58,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:20:59,723 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2024-05-30 20:20:59,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 224 [2024-05-30 20:21:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:21:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822612497] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:21:06,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:21:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 31] total 103 [2024-05-30 20:21:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779784425] [2024-05-30 20:21:06,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:21:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-05-30 20:21:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:21:06,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-05-30 20:21:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=9396, Unknown=0, NotChecked=0, Total=10506 [2024-05-30 20:21:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:06,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:21:06,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 4.194174757281553) internal successors, (432), 103 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:21:06,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:06,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:06,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:06,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-05-30 20:21:10,164 INFO L78 Accepts]: Start accepts. Automaton has currently 285 states, but on-demand construction may add more states Word has length 172 [2024-05-30 20:21:10,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:21:10,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 20:21:10,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:21:10,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:21:10,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:21:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1053904868, now seen corresponding path program 2 times [2024-05-30 20:21:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:21:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474042221] [2024-05-30 20:21:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:21:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:21:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:21:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-05-30 20:21:10,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:21:10,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474042221] [2024-05-30 20:21:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474042221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:21:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:21:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 20:21:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595673998] [2024-05-30 20:21:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:21:10,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 20:21:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:21:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 20:21:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 20:21:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:21:10,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:21:10,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-05-30 20:21:10,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:10,676 INFO L78 Accepts]: Start accepts. Automaton has currently 267 states, but on-demand construction may add more states Word has length 166 [2024-05-30 20:21:10,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:21:10,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 20:21:10,678 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:21:10,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:21:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 448440894, now seen corresponding path program 3 times [2024-05-30 20:21:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:21:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945047259] [2024-05-30 20:21:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:21:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:21:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:21:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:21:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:21:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945047259] [2024-05-30 20:21:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945047259] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:21:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647889865] [2024-05-30 20:21:15,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 20:21:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:21:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:21:15,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:21:15,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 20:21:15,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-30 20:21:15,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:21:15,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 55 conjunts are in the unsatisfiable core [2024-05-30 20:21:15,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:21:16,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-30 20:21:17,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 20:21:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 20:21:18,137 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-05-30 20:21:18,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2024-05-30 20:21:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:21:18,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:21:21,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:21:21,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 99 [2024-05-30 20:21:21,748 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-05-30 20:21:21,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2235 treesize of output 2019 [2024-05-30 20:21:21,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:21:21,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 501 treesize of output 515 [2024-05-30 20:21:21,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:21:21,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 446 treesize of output 394 [2024-05-30 20:21:43,383 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 20:21:43,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 1 [2024-05-30 20:21:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:21:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647889865] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:21:44,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:21:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 33, 30] total 93 [2024-05-30 20:21:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111658704] [2024-05-30 20:21:44,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:21:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-05-30 20:21:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:21:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-05-30 20:21:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=7869, Unknown=39, NotChecked=0, Total=8556 [2024-05-30 20:21:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:44,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:21:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 4.698924731182796) internal successors, (437), 93 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:21:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:44,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:21:56,715 INFO L78 Accepts]: Start accepts. Automaton has currently 258 states, but on-demand construction may add more states Word has length 188 [2024-05-30 20:21:56,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:21:56,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 20:21:56,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:21:56,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:21:56,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:21:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash -738634128, now seen corresponding path program 4 times [2024-05-30 20:21:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:21:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943392561] [2024-05-30 20:21:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:21:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:21:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:21:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-30 20:21:57,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:21:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943392561] [2024-05-30 20:21:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943392561] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 20:21:57,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 20:21:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-30 20:21:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157768299] [2024-05-30 20:21:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 20:21:57,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 20:21:57,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:21:57,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 20:21:57,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-30 20:21:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:57,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:21:57,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:21:57,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:21:57,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:21:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:21:57,096 INFO L78 Accepts]: Start accepts. Automaton has currently 278 states, but on-demand construction may add more states Word has length 206 [2024-05-30 20:21:57,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:21:57,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 20:21:57,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:21:57,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:21:57,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1132746850, now seen corresponding path program 5 times [2024-05-30 20:21:57,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:21:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508060688] [2024-05-30 20:21:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:21:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:21:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:21:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 53 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 20:21:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:21:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508060688] [2024-05-30 20:21:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508060688] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:21:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214311428] [2024-05-30 20:21:57,531 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 20:21:57,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:21:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:21:57,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:21:57,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 20:21:57,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-05-30 20:21:57,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:21:57,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 20:21:57,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:21:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-30 20:21:58,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:21:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-05-30 20:21:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214311428] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:21:58,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:21:58,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 7] total 23 [2024-05-30 20:21:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931904700] [2024-05-30 20:21:58,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:21:58,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-30 20:21:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:21:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-30 20:21:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-05-30 20:21:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:58,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:21:58,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 18.782608695652176) internal successors, (432), 23 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:21:58,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:21:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:21:58,962 INFO L78 Accepts]: Start accepts. Automaton has currently 274 states, but on-demand construction may add more states Word has length 202 [2024-05-30 20:21:58,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:21:58,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 20:21:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:21:59,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:21:59,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:21:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1056269878, now seen corresponding path program 6 times [2024-05-30 20:21:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:21:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234489637] [2024-05-30 20:21:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:21:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:21:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:22:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:22:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:22:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234489637] [2024-05-30 20:22:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234489637] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:22:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538412582] [2024-05-30 20:22:05,035 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 20:22:05,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:22:05,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:22:05,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:22:05,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 20:22:05,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-05-30 20:22:05,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:22:05,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 74 conjunts are in the unsatisfiable core [2024-05-30 20:22:05,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:22:06,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-30 20:22:07,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 20:22:07,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 20:22:08,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2024-05-30 20:22:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-30 20:22:08,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:22:25,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q1_front~0 4)) (.cse7 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (v_~q2_front~0_48 Int) (~q2_back~0 Int) (~q1~0.base Int) (v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse4 (select .cse8 c_~q2~0.base)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse2 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_48) c_~q2~0.offset))) (.cse3 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse2 .cse3) (< ~q2_back~0 v_~q2_front~0_48) (< .cse0 (+ .cse3 1))))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_~q2_front~0_48 Int) (~q1~0.base Int) (v_ArrVal_244 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse13 (select .cse15 c_~q2~0.base)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse10 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse9 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ (* 4 v_~q2_front~0_48) c_~q2~0.offset))) (.cse12 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 v_~q2_front~0_48) (< .cse9 (+ .cse10 1)) (< .cse11 .cse10) (< .cse9 (+ .cse12 1)) (< .cse11 .cse12)))))))) is different from false [2024-05-30 20:22:26,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q1_front~0 4)) (.cse7 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (v_~q2_front~0_48 Int) (~q2_back~0 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse5 (select .cse8 ~q1~0.base)) (.cse4 (select .cse8 c_~q2~0.base))) (let ((.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_48) c_~q2~0.offset))) (.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse3 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse2 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse0 (+ .cse1 1)) (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse0 (+ .cse2 1)) (< ~q2_back~0 v_~q2_front~0_48) (< .cse3 .cse1) (< .cse3 .cse2)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_~q2_front~0_48 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse14 (select .cse15 ~q1~0.base)) (.cse13 (select .cse15 c_~q2~0.base))) (let ((.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_48) c_~q2~0.offset))) (.cse11 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse12 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse9 .cse10) (< v_~q2_front~0_48 1) (< .cse9 .cse11) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse12 (+ .cse11 1)) (< .cse12 (+ .cse10 1)) (< ~q2_back~0 v_~q2_front~0_48)))))))) is different from false [2024-05-30 20:22:26,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (v_~q2_front~0_48 Int) (~q2_back~0 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse1 (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4)))) (.cse2 (select .cse7 (+ (* 4 v_~q2_front~0_48) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse0 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse3 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 .cse1) (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse2 (+ .cse1 1)) (< ~q2_back~0 v_~q2_front~0_48) (< .cse2 (+ .cse3 1)) (< .cse0 .cse3)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_~q2_front~0_48 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4)))) (.cse11 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_48) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse12 (select .cse13 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse9 .cse10) (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse11 (+ .cse10 1)) (< .cse11 (+ .cse12 1)) (< .cse9 .cse12) (< ~q2_back~0 v_~q2_front~0_48)))))))) is different from false [2024-05-30 20:22:26,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_front~0 4)) (.cse5 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_~q2_front~0_48 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse4 (select .cse8 ~q1~0.base))) (let ((.cse0 (select .cse4 (+ .cse7 ~q1~0.offset 4))) (.cse3 (select .cse6 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse2 (select .cse6 (+ (* 4 v_~q2_front~0_48) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse1 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse0 (+ .cse1 1)) (< .cse2 .cse3) (< .cse0 (+ .cse3 1)) (< ~q2_back~0 v_~q2_front~0_48) (< .cse2 .cse1)))))) (forall ((~q1~0.offset Int) (v_~q2_front~0_48 Int) (~q2_back~0 Int) (~q1~0.base Int) (v_ArrVal_243 (Array Int Int)) (v_ArrVal_244 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_244))) (let ((.cse14 (select .cse15 ~q1~0.base)) (.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_48) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse10 (select .cse14 (+ .cse5 ~q1~0.offset 4))) (.cse12 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< .cse9 (+ .cse10 1)) (< v_~q2_front~0_48 1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse9 (+ .cse11 1)) (< ~q2_back~0 v_~q2_front~0_48) (< .cse12 .cse10) (< .cse12 .cse11)))))))) is different from false [2024-05-30 20:22:28,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:28,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2024-05-30 20:22:28,171 INFO L349 Elim1Store]: treesize reduction 9, result has 90.7 percent of original size [2024-05-30 20:22:28,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2085 treesize of output 1848 [2024-05-30 20:22:28,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 20:22:28,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:28,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 822 treesize of output 768 [2024-05-30 20:22:28,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 20:22:28,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:28,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 752 treesize of output 568 [2024-05-30 20:22:43,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:43,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2024-05-30 20:22:43,402 INFO L349 Elim1Store]: treesize reduction 53, result has 45.4 percent of original size [2024-05-30 20:22:43,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3989 treesize of output 3420 [2024-05-30 20:22:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 20:22:43,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 20:22:43,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 799 treesize of output 690 [2024-05-30 20:22:43,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 20:22:43,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-30 20:22:43,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:22:43,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 731 treesize of output 481 [2024-05-30 20:22:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 20:22:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538412582] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:22:44,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:22:44,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 43, 34] total 122 [2024-05-30 20:22:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057429389] [2024-05-30 20:22:44,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:22:44,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2024-05-30 20:22:44,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:22:44,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2024-05-30 20:22:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=13197, Unknown=30, NotChecked=940, Total=14762 [2024-05-30 20:22:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:44,853 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:22:44,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 4.327868852459017) internal successors, (528), 122 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:22:44,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:22:44,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:22:49,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:22:56,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:04,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:06,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:08,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:10,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:12,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:14,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:16,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:18,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:22,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:23:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:23:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:23:34,850 INFO L78 Accepts]: Start accepts. Automaton has currently 293 states, but on-demand construction may add more states Word has length 218 [2024-05-30 20:23:34,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:23:34,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-30 20:23:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-30 20:23:35,056 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:23:35,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:23:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1499961322, now seen corresponding path program 7 times [2024-05-30 20:23:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:23:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928263790] [2024-05-30 20:23:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:23:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:23:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:23:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:23:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:23:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928263790] [2024-05-30 20:23:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928263790] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:23:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42653077] [2024-05-30 20:23:55,352 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 20:23:55,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:23:55,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:23:55,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:23:55,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 20:23:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:23:55,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 53 conjunts are in the unsatisfiable core [2024-05-30 20:23:55,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:23:57,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:23:57,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2024-05-30 20:23:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-30 20:23:57,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:23:59,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:23:59,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 276 [2024-05-30 20:24:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-30 20:24:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42653077] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:24:07,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:24:07,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 26, 21] total 103 [2024-05-30 20:24:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112085063] [2024-05-30 20:24:07,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:24:07,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-05-30 20:24:07,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:24:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-05-30 20:24:07,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=10144, Unknown=0, NotChecked=0, Total=10506 [2024-05-30 20:24:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:07,320 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:24:07,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 4.038834951456311) internal successors, (416), 103 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:24:07,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:07,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:07,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:19,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:19,999 INFO L78 Accepts]: Start accepts. Automaton has currently 336 states, but on-demand construction may add more states Word has length 238 [2024-05-30 20:24:20,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:24:20,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 20:24:20,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 20:24:20,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:24:20,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:24:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1460494506, now seen corresponding path program 8 times [2024-05-30 20:24:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:24:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595863813] [2024-05-30 20:24:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:24:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:24:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:24:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:24:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:24:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595863813] [2024-05-30 20:24:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595863813] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:24:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392711154] [2024-05-30 20:24:26,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 20:24:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:24:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:24:26,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:24:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 20:24:26,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 20:24:26,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:24:26,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 88 conjunts are in the unsatisfiable core [2024-05-30 20:24:26,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:24:35,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:24:35,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2024-05-30 20:24:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:24:36,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:24:37,719 INFO L349 Elim1Store]: treesize reduction 22, result has 90.0 percent of original size [2024-05-30 20:24:37,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 232 [2024-05-30 20:24:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:24:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392711154] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:24:45,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:24:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 52, 52] total 155 [2024-05-30 20:24:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069881459] [2024-05-30 20:24:45,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:24:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2024-05-30 20:24:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:24:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2024-05-30 20:24:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1985, Invalid=21884, Unknown=1, NotChecked=0, Total=23870 [2024-05-30 20:24:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:45,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:24:45,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 3.9548387096774196) internal successors, (613), 155 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:24:45,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:45,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:45,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:45,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:24:55,229 INFO L78 Accepts]: Start accepts. Automaton has currently 501 states, but on-demand construction may add more states Word has length 270 [2024-05-30 20:24:55,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:24:55,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 20:24:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-30 20:24:55,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:24:55,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:24:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2075120158, now seen corresponding path program 9 times [2024-05-30 20:24:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:24:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112321405] [2024-05-30 20:24:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:24:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:24:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:24:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 90 proven. 65 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-05-30 20:24:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:24:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112321405] [2024-05-30 20:24:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112321405] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:24:55,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491670311] [2024-05-30 20:24:55,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 20:24:55,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:24:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:24:55,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:24:55,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 20:24:56,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-30 20:24:56,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:24:56,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 22 conjunts are in the unsatisfiable core [2024-05-30 20:24:56,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:24:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 118 proven. 32 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-05-30 20:24:56,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:24:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 53 proven. 97 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-05-30 20:24:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491670311] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:24:57,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:24:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2024-05-30 20:24:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684970188] [2024-05-30 20:24:57,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:24:57,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-30 20:24:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:24:57,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-30 20:24:57,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2024-05-30 20:24:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:57,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:24:57,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.317073170731707) internal successors, (382), 41 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:57,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:57,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:57,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:24:57,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:24:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 20:24:57,786 INFO L78 Accepts]: Start accepts. Automaton has currently 512 states, but on-demand construction may add more states Word has length 286 [2024-05-30 20:24:57,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:24:57,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 20:24:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:24:57,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:24:57,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:24:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1391797742, now seen corresponding path program 10 times [2024-05-30 20:24:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:24:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577753585] [2024-05-30 20:24:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:24:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:24:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:24:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 90 proven. 125 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-05-30 20:24:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:24:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577753585] [2024-05-30 20:24:58,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577753585] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:24:58,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963023303] [2024-05-30 20:24:58,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 20:24:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:24:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:24:58,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:24:58,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 20:24:58,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 20:24:58,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:24:58,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 20:24:58,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:24:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 70 proven. 28 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-05-30 20:24:59,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:24:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 61 proven. 71 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-05-30 20:24:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963023303] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:24:59,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:24:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 11] total 35 [2024-05-30 20:24:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607690744] [2024-05-30 20:24:59,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:24:59,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-30 20:24:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:24:59,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-30 20:24:59,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-05-30 20:24:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:59,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:24:59,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 13.942857142857143) internal successors, (488), 35 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:24:59,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:24:59,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:24:59,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 20:24:59,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:25:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 20:25:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-30 20:25:00,513 INFO L78 Accepts]: Start accepts. Automaton has currently 536 states, but on-demand construction may add more states Word has length 282 [2024-05-30 20:25:00,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:25:00,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 20:25:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:25:00,715 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:25:00,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:25:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 232050398, now seen corresponding path program 11 times [2024-05-30 20:25:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:25:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488864933] [2024-05-30 20:25:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:25:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:25:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:25:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 20:25:10,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:25:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488864933] [2024-05-30 20:25:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488864933] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:25:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454212933] [2024-05-30 20:25:10,924 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 20:25:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:25:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:25:10,931 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:25:10,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 20:25:11,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-30 20:25:11,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:25:11,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 89 conjunts are in the unsatisfiable core [2024-05-30 20:25:11,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:25:13,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:25:13,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2024-05-30 20:25:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-05-30 20:25:13,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:25:15,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:25:15,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 276 [2024-05-30 20:25:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-05-30 20:25:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454212933] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:25:22,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:25:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 32, 23] total 112 [2024-05-30 20:25:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945851179] [2024-05-30 20:25:22,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:25:22,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2024-05-30 20:25:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:25:22,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2024-05-30 20:25:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=11969, Unknown=0, NotChecked=0, Total=12432 [2024-05-30 20:25:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:22,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:25:22,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 4.464285714285714) internal successors, (500), 112 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:25:22,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-30 20:25:22,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:25:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:25:36,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-30 20:25:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-05-30 20:25:36,983 INFO L78 Accepts]: Start accepts. Automaton has currently 1632 states, but on-demand construction may add more states Word has length 254 [2024-05-30 20:25:36,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 20:25:36,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-30 20:25:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-30 20:25:37,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 20:25:37,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 20:25:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash 212016136, now seen corresponding path program 12 times [2024-05-30 20:25:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 20:25:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817016376] [2024-05-30 20:25:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 20:25:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 20:25:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 20:25:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-30 20:25:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 20:25:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817016376] [2024-05-30 20:25:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817016376] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 20:25:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536883780] [2024-05-30 20:25:45,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 20:25:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:25:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:25:45,952 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 20:25:45,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 20:25:46,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-05-30 20:25:46,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 20:25:46,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-30 20:25:46,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 20:25:48,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 20:25:48,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-05-30 20:25:48,473 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-05-30 20:25:48,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2024-05-30 20:25:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-05-30 20:25:48,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 20:25:49,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:25:49,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2024-05-30 20:25:49,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:25:49,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 174 [2024-05-30 20:25:49,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 20:25:49,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 156 [2024-05-30 20:26:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-05-30 20:26:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536883780] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 20:26:20,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 20:26:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 26, 26] total 104 [2024-05-30 20:26:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108042408] [2024-05-30 20:26:20,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 20:26:20,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-05-30 20:26:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 20:26:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-05-30 20:26:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=9959, Unknown=16, NotChecked=0, Total=10712 [2024-05-30 20:26:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:26:20,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 20:26:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.009615384615385) internal successors, (521), 104 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-05-30 20:26:20,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:26:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:00,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:02,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:04,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:08,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:10,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:12,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:14,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:16,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:18,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:20,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:22,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:24,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:27,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:31,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:33,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:35,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:27:49,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:28:25,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:28:27,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-30 20:29:02,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:29:10,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_~q2_front~0 4))) (let ((.cse27 (select |c_#memory_int| c_~q2~0.base)) (.cse9 (+ c_~q2~0.offset .cse44)) (.cse22 (= c_~j~0 c_~i~0)) (.cse70 (< c_~j~0 c_~i~0))) (let ((.cse5 (or .cse22 .cse70)) (.cse6 (= c_~q1_back~0 c_~q1_front~0)) (.cse43 (* c_~q2_back~0 4)) (.cse30 (select .cse27 .cse9))) (let ((.cse0 (< .cse30 c_~N~0)) (.cse2 (+ .cse30 1)) (.cse14 (+ .cse43 c_~q2~0.offset)) (.cse11 (* c_~q1_back~0 4)) (.cse12 (* c_~q1_front~0 4)) (.cse18 (+ c_~i~0 1)) (.cse19 (< c_~q2_back~0 0)) (.cse20 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse3 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse4 (< c_~q2_front~0 0)) (.cse21 (and .cse5 .cse6 (or (= c_~q2_front~0 c_~q2_back~0) .cse70)))) (and (<= 0 c_~i~0) (or (let ((.cse1 (< (+ |c_thread1Thread1of1ForFork0_#t~post5#1| 1) c_~N~0))) (and (or .cse0 .cse1) (or .cse1 (< |c_thread1Thread1of1ForFork0_#t~post5#1| .cse2)))) .cse3 .cse4) (or (not (= c_~q2_front~0 0)) (and .cse5 .cse6) (not (= c_~q2_back~0 0))) (or (and (forall ((v_ArrVal_127 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse8 (select .cse13 c_~q2~0.base))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse10 (select .cse13 ~q1~0.base))) (let ((.cse7 (select .cse10 (+ .cse12 ~q1~0.offset)))) (or (< .cse7 (+ (select .cse8 .cse9) 1)) (< .cse7 c_~i~0) (not (= c_~j~0 (select .cse10 (+ .cse11 ~q1~0.offset)))))))) (not (= (select .cse8 .cse14) c_~i~0)))))) (forall ((v_ArrVal_127 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse15 (select .cse17 c_~q2~0.base))) (or (not (= (select .cse15 .cse14) c_~i~0)) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse16 (select .cse17 ~q1~0.base))) (or (< (select .cse16 (+ .cse12 ~q1~0.offset)) c_~i~0) (not (= c_~j~0 (select .cse16 (+ .cse11 ~q1~0.offset))))))) (< (select .cse15 .cse9) .cse18)))))) .cse19 .cse20 .cse3 .cse4) (or .cse19 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse20 .cse3 .cse4 .cse21) .cse22 (or (let ((.cse23 (< .cse18 c_~N~0))) (and (or .cse0 .cse23) (or (< c_~i~0 .cse2) .cse23))) .cse3 .cse4) (or (= c_~i~0 .cse2) .cse3 .cse4) (or .cse3 .cse4 (and (or .cse0 (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse24 (select |c_#memory_int| ~q1~0.base))) (or (not (= (select .cse24 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse24 (+ .cse12 ~q1~0.offset)) 1) c_~N~0))))) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse25 (select |c_#memory_int| ~q1~0.base))) (let ((.cse26 (select .cse25 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse25 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (+ .cse26 1) c_~N~0) (< .cse26 .cse2))))))) (or .cse19 .cse20 .cse3 .cse4 (not (= c_~i~0 (select .cse27 .cse14))) (and (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse28 (select |c_#memory_int| ~q1~0.base))) (let ((.cse29 (select .cse28 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse28 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< .cse29 c_~i~0) (< .cse29 .cse2))))) (or (< .cse30 .cse18) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse31 (select |c_#memory_int| ~q1~0.base))) (or (not (= (select .cse31 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse31 (+ .cse12 ~q1~0.offset)) c_~i~0))))))) (or (let ((.cse33 (select (select |c_#memory_int| c_~q1~0.base) (+ .cse12 c_~q1~0.offset)))) (let ((.cse32 (< (+ .cse33 1) c_~N~0))) (and (or .cse0 .cse32) (or .cse32 (< .cse33 .cse2))))) .cse3 .cse4) (or .cse19 .cse20 (let ((.cse35 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse36 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse34 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse34 .cse35) .cse18) (not (= (select .cse34 .cse36) c_~i~0)) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse37 (select .cse38 ~q1~0.base))) (or (not (= (select .cse37 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse37 (+ .cse12 ~q1~0.offset)) c_~i~0)))))))) (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse41 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse39 (select .cse42 ~q1~0.base))) (let ((.cse40 (select .cse39 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse39 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< .cse40 (+ (select .cse41 .cse35) 1)) (< .cse40 c_~i~0))))) (not (= (select .cse41 .cse36) c_~i~0)))))))) .cse3 .cse4) (or .cse19 (let ((.cse47 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse46 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse45 .cse46) c_~i~0)) (< (select .cse45 .cse47) .cse18) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse48 (select .cse49 ~q1~0.base))) (or (not (= (select .cse48 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse48 (+ .cse12 ~q1~0.offset)) c_~i~0)))))))) (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse52 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse50 (select .cse53 ~q1~0.base))) (let ((.cse51 (select .cse50 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse50 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< .cse51 (+ (select .cse52 .cse47) 1)) (< .cse51 c_~i~0))))) (not (= (select .cse52 .cse46) c_~i~0)))))))) .cse20 .cse3 .cse4) (or .cse19 (and (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse56 (select .cse57 c_~q2~0.base))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse54 (select .cse57 ~q1~0.base))) (let ((.cse55 (select .cse54 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse54 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< .cse55 (+ (select .cse56 .cse9) 1)) (< .cse55 c_~i~0))))) (not (= c_~i~0 (select .cse56 .cse14))))))) (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse58 (select .cse60 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse58 .cse14))) (< (select .cse58 .cse9) .cse18) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse59 (select .cse60 ~q1~0.base))) (or (not (= (select .cse59 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse59 (+ .cse12 ~q1~0.offset)) c_~i~0))))))))) .cse20 .cse3 .cse4) (or .cse19 (let ((.cse66 (+ .cse43 |c_ULTIMATE.start_main_#t~ret17#1.offset|)) (.cse64 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse44))) (and (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse61 (select .cse65 ~q1~0.base))) (let ((.cse62 (select .cse61 (+ .cse12 ~q1~0.offset)))) (or (not (= (select .cse61 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< .cse62 c_~i~0) (< .cse62 (+ (select .cse63 .cse64) 1)))))) (not (= (select .cse63 .cse66) c_~i~0)))))) (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_126 (Array Int Int))) (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_127))) (let ((.cse67 (select .cse69 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (not (= (select .cse67 .cse66) c_~i~0)) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse68 (select .cse69 ~q1~0.base))) (or (not (= (select .cse68 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse68 (+ .cse12 ~q1~0.offset)) c_~i~0)))) (< (select .cse67 .cse64) .cse18))))))) .cse20 .cse3 .cse4) (or .cse19 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse20 .cse3 .cse4 .cse21) (or .cse19 .cse20 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3 .cse4 .cse21)))))) is different from false [2024-05-30 20:31:32,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 20:32:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 272 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 361 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2024-05-30 20:32:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-30 20:32:15,450 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 20:32:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 20:32:15,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 20:32:15,655 INFO L445 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1] [2024-05-30 20:32:15,656 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-30 20:32:15,660 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:32:15,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 20:32:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:32:15,661 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 20:32:15,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-05-30 20:32:15,684 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 20:32:15,684 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 20:32:15,684 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;@385aa3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:32:15,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 20:32:15,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 20:32:15,691 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 20:32:15,691 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-30 20:32:15,694 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:32:15,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 20:32:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 20:32:15,696 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 20:32:15,702 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 20:32:15,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 20:32:15,703 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;@385aa3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 20:32:15,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 20:32:15,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-05-30 20:32:15,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 20:32:15,828 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 20:32:15,828 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-30 20:32:15,829 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 20:32:15,829 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 20:32:15,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 08:32:15 BasicIcfg [2024-05-30 20:32:15,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 20:32:15,833 INFO L158 Benchmark]: Toolchain (without parser) took 688870.26ms. Allocated memory was 268.4MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 237.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-05-30 20:32:15,833 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 20:32:15,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.12ms. Allocated memory is still 268.4MB. Free memory was 237.2MB in the beginning and 224.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 20:32:15,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.41ms. Allocated memory is still 268.4MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 20:32:15,834 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 268.4MB. Free memory was 222.7MB in the beginning and 221.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 20:32:15,834 INFO L158 Benchmark]: RCFGBuilder took 614.73ms. Allocated memory is still 268.4MB. Free memory was 221.2MB in the beginning and 210.9MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 20:32:15,834 INFO L158 Benchmark]: TraceAbstraction took 687925.45ms. Allocated memory was 268.4MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 209.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-05-30 20:32:15,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.12ms. Allocated memory is still 268.4MB. Free memory was 237.2MB in the beginning and 224.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.41ms. Allocated memory is still 268.4MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 268.4MB. Free memory was 222.7MB in the beginning and 221.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 614.73ms. Allocated memory is still 268.4MB. Free memory was 221.2MB in the beginning and 210.9MB in the end (delta: 10.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 687925.45ms. Allocated memory was 268.4MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 209.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 78131, independent: 71329, independent conditional: 71329, independent unconditional: 0, dependent: 6802, dependent conditional: 6802, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71820, independent: 71329, independent conditional: 71329, independent unconditional: 0, dependent: 491, dependent conditional: 491, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71820, independent: 71329, independent conditional: 71329, independent unconditional: 0, dependent: 491, dependent conditional: 491, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79670, independent: 71329, independent conditional: 386, independent unconditional: 70943, dependent: 8341, dependent conditional: 7464, dependent unconditional: 877, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79670, independent: 71329, independent conditional: 386, independent unconditional: 70943, dependent: 8341, dependent conditional: 4699, dependent unconditional: 3642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79670, independent: 71329, independent conditional: 386, independent unconditional: 70943, dependent: 8341, dependent conditional: 4699, dependent unconditional: 3642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 298, independent: 224, independent conditional: 5, independent unconditional: 219, dependent: 74, dependent conditional: 72, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 298, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 80, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 74, dependent conditional: 72, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 74, dependent conditional: 72, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 317, independent: 19, independent conditional: 12, independent unconditional: 8, dependent: 298, dependent conditional: 257, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 79670, independent: 71105, independent conditional: 381, independent unconditional: 70724, dependent: 8267, dependent conditional: 4627, dependent unconditional: 3640, unknown: 298, unknown conditional: 77, unknown unconditional: 221] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 224, Positive conditional cache size: 5, Positive unconditional cache size: 219, Negative cache size: 74, Negative conditional cache size: 72, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2765, Maximal queried relation: 15, Independence queries for same thread: 6311 - StatisticsResult: Visitor Statistics States: 203, Transitions: 221, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 203, Transitions: 214, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 210, Transitions: 221, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 217, Transitions: 228, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 232, Transitions: 241, Traversal time: 3.2s - StatisticsResult: Visitor Statistics States: 226, Transitions: 234, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 208, Transitions: 211, Traversal time: 12.0s - StatisticsResult: Visitor Statistics States: 225, Transitions: 228, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 222, Transitions: 224, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 239, Transitions: 241, Traversal time: 50.0s - StatisticsResult: Visitor Statistics States: 272, Transitions: 274, Traversal time: 12.7s - StatisticsResult: Visitor Statistics States: 420, Transitions: 425, Traversal time: 9.9s - StatisticsResult: Visitor Statistics States: 429, Transitions: 434, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 469, Transitions: 473, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 1596, Transitions: 1629, Traversal time: 14.3s - StatisticsResult: Visitor Statistics States: 43185, Transitions: 45382, Traversal time: 354.9s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 10 - StatisticsResult: Visitor Statistics States: 121, Transitions: 128, Traversal time: 0.0s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 125, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 79, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 46 - StatisticsResult: Visitor Statistics States: 185, Transitions: 218, Traversal time: 0.1s - PositiveResult [Line: 102]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 191 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 687.6s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 459.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1627, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 222.1s InterpolantComputationTime, 5359 NumberOfCodeBlocks, 5202 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 7604 ConstructedInterpolants, 175 QuantifiedInterpolants, 136263 SizeOfPredicates, 328 NumberOfNonLiveVariables, 4500 ConjunctsInSsa, 487 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 3368/6007 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 191 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 191 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-30 20:32:15,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Forceful destruction successful, exit code 0 [2024-05-30 20:32:16,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Forceful destruction successful, exit code 0 [2024-05-30 20:32:16,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-30 20:32:16,665 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 20:32:16,772 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 137 Received shutdown request...