/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-properties/list_flag-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 16:33:14,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 16:33:14,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 16:33:14,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 16:33:14,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 16:33:14,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 16:33:14,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 16:33:14,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 16:33:14,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 16:33:14,642 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 16:33:14,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 16:33:14,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 16:33:14,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 16:33:14,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 16:33:14,644 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 16:33:14,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 16:33:14,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 16:33:14,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 16:33:14,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 16:33:14,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 16:33:14,646 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 16:33:14,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 16:33:14,646 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 16:33:14,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 16:33:14,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 16:33:14,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 16:33:14,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:33:14,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 16:33:14,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 16:33:14,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 16:33:14,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 16:33:14,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 16:33:14,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 16:33:14,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 16:33:14,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 16:33:14,890 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 16:33:14,890 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 16:33:14,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag-2.i [2023-12-19 16:33:15,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 16:33:16,132 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 16:33:16,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-2.i [2023-12-19 16:33:16,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0bde1723/30585b93d04441089be996da8c712807/FLAG90387849c [2023-12-19 16:33:16,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0bde1723/30585b93d04441089be996da8c712807 [2023-12-19 16:33:16,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 16:33:16,155 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 16:33:16,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 16:33:16,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 16:33:16,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 16:33:16,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b3498a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16, skipping insertion in model container [2023-12-19 16:33:16,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,200 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 16:33:16,410 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-2.i[23375,23388] [2023-12-19 16:33:16,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:33:16,422 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 16:33:16,453 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-2.i[23375,23388] [2023-12-19 16:33:16,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 16:33:16,482 INFO L206 MainTranslator]: Completed translation [2023-12-19 16:33:16,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16 WrapperNode [2023-12-19 16:33:16,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 16:33:16,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 16:33:16,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 16:33:16,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 16:33:16,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,527 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2023-12-19 16:33:16,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 16:33:16,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 16:33:16,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 16:33:16,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 16:33:16,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,569 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-12-19 16:33:16,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 16:33:16,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 16:33:16,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 16:33:16,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 16:33:16,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (1/1) ... [2023-12-19 16:33:16,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 16:33:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:16,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 16:33:16,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-19 16:33:16,641 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 16:33:16,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 16:33:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 16:33:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 16:33:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 16:33:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 16:33:16,732 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 16:33:16,734 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 16:33:16,767 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-19 16:33:16,874 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 16:33:16,888 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 16:33:16,888 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-19 16:33:16,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:16 BoogieIcfgContainer [2023-12-19 16:33:16,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 16:33:16,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 16:33:16,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 16:33:16,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 16:33:16,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:33:16" (1/3) ... [2023-12-19 16:33:16,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bc457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:16, skipping insertion in model container [2023-12-19 16:33:16,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:16" (2/3) ... [2023-12-19 16:33:16,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bc457b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:16, skipping insertion in model container [2023-12-19 16:33:16,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:16" (3/3) ... [2023-12-19 16:33:16,897 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2023-12-19 16:33:16,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 16:33:16,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 16:33:16,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 16:33:16,946 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=PETRI_NET, 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;@76c369ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 16:33:16,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 16:33:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-19 16:33:16,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:16,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:16,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:16,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash -111407645, now seen corresponding path program 1 times [2023-12-19 16:33:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:16,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807348697] [2023-12-19 16:33:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:16,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807348697] [2023-12-19 16:33:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807348697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:17,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:17,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 16:33:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941265789] [2023-12-19 16:33:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:17,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 16:33:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 16:33:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:33:17,084 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:17,103 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2023-12-19 16:33:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 16:33:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2023-12-19 16:33:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:17,108 INFO L225 Difference]: With dead ends: 37 [2023-12-19 16:33:17,108 INFO L226 Difference]: Without dead ends: 19 [2023-12-19 16:33:17,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 16:33:17,112 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:17,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-19 16:33:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-19 16:33:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-19 16:33:17,132 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2023-12-19 16:33:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:17,132 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-19 16:33:17,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-19 16:33:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-19 16:33:17,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:17,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:17,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 16:33:17,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:17,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash 34120441, now seen corresponding path program 1 times [2023-12-19 16:33:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346953061] [2023-12-19 16:33:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:17,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346953061] [2023-12-19 16:33:17,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346953061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:17,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:17,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:33:17,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084444961] [2023-12-19 16:33:17,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:33:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:33:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:33:17,378 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:17,464 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-12-19 16:33:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:33:17,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2023-12-19 16:33:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:17,466 INFO L225 Difference]: With dead ends: 43 [2023-12-19 16:33:17,466 INFO L226 Difference]: Without dead ends: 39 [2023-12-19 16:33:17,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:33:17,468 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:17,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-19 16:33:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2023-12-19 16:33:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-19 16:33:17,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 12 [2023-12-19 16:33:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:17,478 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-19 16:33:17,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-19 16:33:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-19 16:33:17,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:17,479 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:17,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 16:33:17,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:17,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:17,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1521318348, now seen corresponding path program 1 times [2023-12-19 16:33:17,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:17,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990453063] [2023-12-19 16:33:17,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990453063] [2023-12-19 16:33:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990453063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:33:17,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62948703] [2023-12-19 16:33:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:17,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:33:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:33:17,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:33:17,602 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:17,683 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-12-19 16:33:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:33:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2023-12-19 16:33:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:17,693 INFO L225 Difference]: With dead ends: 45 [2023-12-19 16:33:17,694 INFO L226 Difference]: Without dead ends: 37 [2023-12-19 16:33:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:33:17,697 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:17,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-19 16:33:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2023-12-19 16:33:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-19 16:33:17,702 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 14 [2023-12-19 16:33:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:17,703 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-19 16:33:17,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-19 16:33:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-19 16:33:17,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:17,704 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:17,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 16:33:17,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:17,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1529907427, now seen corresponding path program 1 times [2023-12-19 16:33:17,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:17,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028862284] [2023-12-19 16:33:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028862284] [2023-12-19 16:33:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028862284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 16:33:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900987858] [2023-12-19 16:33:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:17,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 16:33:17,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:17,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 16:33:17,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 16:33:17,864 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:17,933 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-12-19 16:33:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 16:33:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2023-12-19 16:33:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:17,934 INFO L225 Difference]: With dead ends: 43 [2023-12-19 16:33:17,934 INFO L226 Difference]: Without dead ends: 33 [2023-12-19 16:33:17,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 16:33:17,935 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:17,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-19 16:33:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2023-12-19 16:33:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-19 16:33:17,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-12-19 16:33:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:17,953 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-19 16:33:17,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-19 16:33:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 16:33:17,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:17,954 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:17,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 16:33:17,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:17,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1748370994, now seen corresponding path program 1 times [2023-12-19 16:33:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447393500] [2023-12-19 16:33:17,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447393500] [2023-12-19 16:33:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447393500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:17,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:33:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206407097] [2023-12-19 16:33:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:17,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:33:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:33:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:33:17,987 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:17,996 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2023-12-19 16:33:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:33:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2023-12-19 16:33:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:17,997 INFO L225 Difference]: With dead ends: 49 [2023-12-19 16:33:17,997 INFO L226 Difference]: Without dead ends: 33 [2023-12-19 16:33:17,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:33:17,998 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:17,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-19 16:33:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-12-19 16:33:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-19 16:33:18,007 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2023-12-19 16:33:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:18,008 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-19 16:33:18,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-19 16:33:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 16:33:18,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:18,009 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:18,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 16:33:18,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:18,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2102859357, now seen corresponding path program 1 times [2023-12-19 16:33:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416318325] [2023-12-19 16:33:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416318325] [2023-12-19 16:33:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416318325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509383236] [2023-12-19 16:33:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:18,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:18,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 16:33:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:18,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-19 16:33:18,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:18,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:18,434 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 11 treesize of output 7 [2023-12-19 16:33:18,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:18,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:18,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-19 16:33:18,605 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 16 treesize of output 11 [2023-12-19 16:33:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:18,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:18,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-12-19 16:33:18,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:18,725 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 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-19 16:33:18,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:18,737 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 30 treesize of output 33 [2023-12-19 16:33:18,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-19 16:33:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 16:33:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509383236] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:18,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-12-19 16:33:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930312504] [2023-12-19 16:33:18,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:18,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 16:33:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 16:33:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=4, NotChecked=34, Total=380 [2023-12-19 16:33:18,838 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:19,115 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-12-19 16:33:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 16:33:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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) Word has length 18 [2023-12-19 16:33:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:19,116 INFO L225 Difference]: With dead ends: 58 [2023-12-19 16:33:19,116 INFO L226 Difference]: Without dead ends: 54 [2023-12-19 16:33:19,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=450, Unknown=8, NotChecked=46, Total=650 [2023-12-19 16:33:19,118 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:19,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 110 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 158 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2023-12-19 16:33:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-19 16:33:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2023-12-19 16:33:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-12-19 16:33:19,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 18 [2023-12-19 16:33:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:19,123 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-12-19 16:33:19,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-12-19 16:33:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 16:33:19,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:19,124 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:19,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 16:33:19,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-19 16:33:19,327 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:19,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1959790288, now seen corresponding path program 1 times [2023-12-19 16:33:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:19,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37468472] [2023-12-19 16:33:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37468472] [2023-12-19 16:33:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37468472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071319061] [2023-12-19 16:33:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:19,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 16:33:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:19,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-19 16:33:19,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:19,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:19,614 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 11 treesize of output 7 [2023-12-19 16:33:19,649 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:19,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-19 16:33:19,707 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 16 treesize of output 11 [2023-12-19 16:33:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:19,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:19,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2023-12-19 16:33:19,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:19,790 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 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-19 16:33:19,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:19,799 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 30 treesize of output 33 [2023-12-19 16:33:19,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-19 16:33:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 16:33:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071319061] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:19,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-12-19 16:33:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511200837] [2023-12-19 16:33:19,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:19,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 16:33:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 16:33:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=269, Unknown=3, NotChecked=34, Total=380 [2023-12-19 16:33:19,874 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:20,107 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-12-19 16:33:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 16:33:20,108 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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) Word has length 18 [2023-12-19 16:33:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:20,108 INFO L225 Difference]: With dead ends: 58 [2023-12-19 16:33:20,108 INFO L226 Difference]: Without dead ends: 54 [2023-12-19 16:33:20,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=413, Unknown=7, NotChecked=44, Total=600 [2023-12-19 16:33:20,109 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 115 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:20,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 115 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 1 Unknown, 50 Unchecked, 0.1s Time] [2023-12-19 16:33:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-19 16:33:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2023-12-19 16:33:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2023-12-19 16:33:20,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 18 [2023-12-19 16:33:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:20,113 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2023-12-19 16:33:20,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2023-12-19 16:33:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 16:33:20,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:20,114 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:20,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 16:33:20,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-19 16:33:20,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:20,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1516053343, now seen corresponding path program 1 times [2023-12-19 16:33:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85728623] [2023-12-19 16:33:20,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85728623] [2023-12-19 16:33:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85728623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 16:33:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 16:33:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 16:33:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460486252] [2023-12-19 16:33:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 16:33:20,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 16:33:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 16:33:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:33:20,340 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:20,347 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-12-19 16:33:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 16:33:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2023-12-19 16:33:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:20,348 INFO L225 Difference]: With dead ends: 52 [2023-12-19 16:33:20,348 INFO L226 Difference]: Without dead ends: 38 [2023-12-19 16:33:20,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 16:33:20,349 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:20,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 16:33:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-19 16:33:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-12-19 16:33:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-12-19 16:33:20,352 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2023-12-19 16:33:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:20,352 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-12-19 16:33:20,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-12-19 16:33:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-19 16:33:20,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:20,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:20,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 16:33:20,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:20,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2047377800, now seen corresponding path program 1 times [2023-12-19 16:33:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551863116] [2023-12-19 16:33:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:20,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551863116] [2023-12-19 16:33:20,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551863116] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740303414] [2023-12-19 16:33:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:20,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:20,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:20,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 16:33:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:20,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-19 16:33:20,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:20,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:20,689 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:20,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:20,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:20,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 16:33:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-19 16:33:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-19 16:33:20,757 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 32 treesize of output 19 [2023-12-19 16:33:20,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-19 16:33:20,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 16:33:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:20,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:20,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2023-12-19 16:33:20,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_230 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_231 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-12-19 16:33:20,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:20,881 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 22 treesize of output 23 [2023-12-19 16:33:20,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:20,888 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 36 treesize of output 35 [2023-12-19 16:33:20,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:20,902 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:20,902 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 22 treesize of output 1 [2023-12-19 16:33:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-19 16:33:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740303414] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:20,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-12-19 16:33:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393052154] [2023-12-19 16:33:20,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:20,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 16:33:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 16:33:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2023-12-19 16:33:20,983 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:21,161 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2023-12-19 16:33:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 16:33:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 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) Word has length 20 [2023-12-19 16:33:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:21,163 INFO L225 Difference]: With dead ends: 68 [2023-12-19 16:33:21,163 INFO L226 Difference]: Without dead ends: 64 [2023-12-19 16:33:21,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=271, Unknown=1, NotChecked=34, Total=380 [2023-12-19 16:33:21,165 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 101 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:21,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 83 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2023-12-19 16:33:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-19 16:33:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2023-12-19 16:33:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-12-19 16:33:21,183 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 20 [2023-12-19 16:33:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:21,183 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-12-19 16:33:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-12-19 16:33:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-19 16:33:21,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:21,184 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:21,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 16:33:21,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:21,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:21,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash -400667693, now seen corresponding path program 2 times [2023-12-19 16:33:21,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305242833] [2023-12-19 16:33:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305242833] [2023-12-19 16:33:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305242833] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916627783] [2023-12-19 16:33:21,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 16:33:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:21,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:21,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 16:33:21,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 16:33:21,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 16:33:21,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-19 16:33:21,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:21,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:21,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:21,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:21,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:21,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 16:33:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-19 16:33:21,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-19 16:33:21,900 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 32 treesize of output 19 [2023-12-19 16:33:21,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-19 16:33:21,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 16:33:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:21,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:21,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2023-12-19 16:33:22,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:22,019 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 22 treesize of output 23 [2023-12-19 16:33:22,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:22,027 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 36 treesize of output 35 [2023-12-19 16:33:22,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:22,041 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:22,042 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 22 treesize of output 1 [2023-12-19 16:33:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916627783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:22,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-12-19 16:33:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969547990] [2023-12-19 16:33:22,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:22,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 16:33:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 16:33:22,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=225, Unknown=4, NotChecked=0, Total=272 [2023-12-19 16:33:22,134 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:22,440 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2023-12-19 16:33:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 16:33:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 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) Word has length 22 [2023-12-19 16:33:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:22,441 INFO L225 Difference]: With dead ends: 70 [2023-12-19 16:33:22,441 INFO L226 Difference]: Without dead ends: 58 [2023-12-19 16:33:22,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=521, Unknown=4, NotChecked=0, Total=650 [2023-12-19 16:33:22,442 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 108 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 127 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 16:33:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-19 16:33:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-19 16:33:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-19 16:33:22,449 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 22 [2023-12-19 16:33:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:22,449 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-19 16:33:22,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-19 16:33:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-19 16:33:22,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:22,450 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:22,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-19 16:33:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:22,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:22,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash -740022522, now seen corresponding path program 1 times [2023-12-19 16:33:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045698440] [2023-12-19 16:33:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045698440] [2023-12-19 16:33:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045698440] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825308361] [2023-12-19 16:33:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:22,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:22,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:22,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:22,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 16:33:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:22,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-19 16:33:22,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:22,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:23,036 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:23,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:23,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:23,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:23,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 16:33:23,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-19 16:33:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-19 16:33:23,111 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 32 treesize of output 19 [2023-12-19 16:33:23,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-19 16:33:23,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-19 16:33:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:23,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:23,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2023-12-19 16:33:23,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:23,219 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 22 treesize of output 23 [2023-12-19 16:33:23,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:23,225 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 36 treesize of output 35 [2023-12-19 16:33:23,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:23,237 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:23,238 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 22 treesize of output 1 [2023-12-19 16:33:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825308361] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:23,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-19 16:33:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793534963] [2023-12-19 16:33:23,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-19 16:33:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-19 16:33:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=390, Unknown=4, NotChecked=0, Total=462 [2023-12-19 16:33:23,324 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:23,615 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2023-12-19 16:33:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 16:33:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 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) Word has length 22 [2023-12-19 16:33:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:23,615 INFO L225 Difference]: With dead ends: 64 [2023-12-19 16:33:23,615 INFO L226 Difference]: Without dead ends: 52 [2023-12-19 16:33:23,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=752, Unknown=4, NotChecked=0, Total=930 [2023-12-19 16:33:23,616 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 187 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:23,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 146 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 16:33:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-19 16:33:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2023-12-19 16:33:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-12-19 16:33:23,619 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2023-12-19 16:33:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:23,619 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-12-19 16:33:23,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-12-19 16:33:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-19 16:33:23,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:23,620 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:23,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 16:33:23,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 16:33:23,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:23,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 619917389, now seen corresponding path program 3 times [2023-12-19 16:33:23,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:23,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929103146] [2023-12-19 16:33:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:24,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929103146] [2023-12-19 16:33:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929103146] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984299647] [2023-12-19 16:33:24,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 16:33:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:24,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:24,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:24,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 16:33:24,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-19 16:33:24,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 16:33:24,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-19 16:33:24,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:24,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:24,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 16:33:24,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-19 16:33:24,445 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 11 treesize of output 7 [2023-12-19 16:33:24,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:24,491 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 16:33:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 15 [2023-12-19 16:33:24,496 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 11 treesize of output 7 [2023-12-19 16:33:24,505 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-19 16:33:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 24 treesize of output 17 [2023-12-19 16:33:24,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 16:33:24,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 80 [2023-12-19 16:33:24,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-19 16:33:24,587 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 27 treesize of output 22 [2023-12-19 16:33:24,643 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-19 16:33:24,643 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 1 case distinctions, treesize of input 23 treesize of output 30 [2023-12-19 16:33:24,655 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 16:33:24,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 47 treesize of output 40 [2023-12-19 16:33:24,674 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2023-12-19 16:33:24,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2023-12-19 16:33:24,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2023-12-19 16:33:24,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-12-19 16:33:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2023-12-19 16:33:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:25,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:25,591 INFO L349 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-12-19 16:33:25,592 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 3764 treesize of output 3532 [2023-12-19 16:33:25,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:25,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 561 treesize of output 540 [2023-12-19 16:33:25,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:25,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:25,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 4 [2023-12-19 16:33:25,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:25,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-12-19 16:33:25,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:25,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-12-19 16:33:25,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:25,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-12-19 16:33:25,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:25,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-12-19 16:33:25,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:25,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 11 [2023-12-19 16:33:25,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-19 16:33:26,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse4) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse4 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse5) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse6 0) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse7) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (select v_arrayElimArr_9 .cse2) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (forall ((v_ArrVal_423 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse8) (= .cse8 0) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse9) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse9 0)))))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_419 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse10) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse11) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse12)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (forall ((v_ArrVal_423 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse13) (= .cse13 0) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse14 0) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse15) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse15)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse16) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (select v_arrayElimArr_9 .cse2) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse17) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse17)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2023-12-19 16:33:26,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,784 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 51 treesize of output 41 [2023-12-19 16:33:26,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,790 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 25 treesize of output 26 [2023-12-19 16:33:26,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:26,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-12-19 16:33:26,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-12-19 16:33:26,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:26,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-19 16:33:26,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:26,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,866 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 25 treesize of output 26 [2023-12-19 16:33:26,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,879 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 51 treesize of output 41 [2023-12-19 16:33:26,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:26,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-19 16:33:26,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-19 16:33:26,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:26,911 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:26,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2023-12-19 16:33:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:26,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,930 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 51 treesize of output 41 [2023-12-19 16:33:26,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,938 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 25 treesize of output 26 [2023-12-19 16:33:26,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:26,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:26,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:26,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2023-12-19 16:33:26,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-19 16:33:26,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-19 16:33:26,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-12-19 16:33:26,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-19 16:33:26,971 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:26,972 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 47 treesize of output 1 [2023-12-19 16:33:26,981 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:26,981 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 23 treesize of output 1 [2023-12-19 16:33:26,990 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:26,990 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 47 treesize of output 1 [2023-12-19 16:33:26,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:26,997 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 70 treesize of output 50 [2023-12-19 16:33:27,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:27,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:27,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 67 [2023-12-19 16:33:27,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-12-19 16:33:27,042 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 16:33:27,048 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 16:33:27,049 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 43 treesize of output 1 [2023-12-19 16:33:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-19 16:33:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984299647] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:27,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2023-12-19 16:33:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607562466] [2023-12-19 16:33:27,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-19 16:33:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-19 16:33:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1064, Unknown=8, NotChecked=66, Total=1260 [2023-12-19 16:33:27,241 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:32,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-19 16:33:36,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-19 16:33:36,554 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse14 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse3 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse4) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse6) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse6 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_417 Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse7 (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 v_ArrVal_417)))) (store .cse9 |v_ULTIMATE.start_main_~p~0#1.base_61| (store (select .cse9 |v_ULTIMATE.start_main_~p~0#1.base_61|) 0 3))))) (let ((.cse8 (select (select .cse7 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 0)) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (or (not (= (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse8 3) (= .cse8 1))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse11 (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse10 (select (select .cse11 (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (or (= .cse10 1) (= 3 .cse10)))) (not (= (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse12) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse12)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse13 0) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) .cse14 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse15) (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (select v_arrayElimArr_9 .cse2) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (forall ((v_ArrVal_423 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse16) (= .cse16 0) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))) (= .cse5 0) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse17) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse17 0)))))) (forall ((v_ArrVal_424 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_ArrVal_419 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse18) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse19) (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (forall ((v_ArrVal_423 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse21) (= .cse21 0) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= .cse22 0) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse23) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse23)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse24) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (not (= (select v_arrayElimArr_9 .cse2) 0))))))) .cse14) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_61| Int)) (or (forall ((v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 .cse2) 0)) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_423) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_419 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_419) |v_ULTIMATE.start_main_~p~0#1.base_61| v_ArrVal_424) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_61| .cse25) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse25)))) (= |v_ULTIMATE.start_main_~p~0#1.base_61| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2023-12-19 16:33:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:37,448 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2023-12-19 16:33:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 16:33:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 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) Word has length 26 [2023-12-19 16:33:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:37,449 INFO L225 Difference]: With dead ends: 78 [2023-12-19 16:33:37,449 INFO L226 Difference]: Without dead ends: 74 [2023-12-19 16:33:37,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=335, Invalid=2420, Unknown=9, NotChecked=206, Total=2970 [2023-12-19 16:33:37,451 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 133 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:37,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 378 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 574 Invalid, 2 Unknown, 95 Unchecked, 8.5s Time] [2023-12-19 16:33:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-19 16:33:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2023-12-19 16:33:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-12-19 16:33:37,459 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2023-12-19 16:33:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:37,459 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-12-19 16:33:37,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-12-19 16:33:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-19 16:33:37,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:37,461 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:37,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 16:33:37,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:37,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:37,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1006497058, now seen corresponding path program 2 times [2023-12-19 16:33:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213602376] [2023-12-19 16:33:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213602376] [2023-12-19 16:33:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213602376] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163606823] [2023-12-19 16:33:38,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 16:33:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:38,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:38,158 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 16:33:38,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 16:33:38,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 16:33:38,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-19 16:33:38,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:38,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:38,292 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 16:33:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 16:33:38,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:38,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:38,382 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 11 treesize of output 7 [2023-12-19 16:33:38,390 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-19 16:33:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 33 treesize of output 24 [2023-12-19 16:33:38,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:38,397 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 16 treesize of output 11 [2023-12-19 16:33:38,434 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-19 16:33:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-19 16:33:38,509 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-19 16:33:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 147 [2023-12-19 16:33:38,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2023-12-19 16:33:38,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-12-19 16:33:38,614 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-19 16:33:38,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 153 [2023-12-19 16:33:38,630 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-19 16:33:38,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 142 [2023-12-19 16:33:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2023-12-19 16:33:38,736 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-19 16:33:38,736 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 50 [2023-12-19 16:33:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-19 16:33:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:38,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:39,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:39,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2023-12-19 16:33:39,043 INFO L349 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2023-12-19 16:33:39,044 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 1662 treesize of output 1608 [2023-12-19 16:33:39,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:39,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 487 treesize of output 445 [2023-12-19 16:33:39,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-19 16:33:39,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:39,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2023-12-19 16:33:40,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-12-19 16:33:40,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,650 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 27 treesize of output 28 [2023-12-19 16:33:40,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:40,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-12-19 16:33:40,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-12-19 16:33:40,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:40,670 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-19 16:33:40,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-12-19 16:33:40,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,692 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 59 treesize of output 49 [2023-12-19 16:33:40,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,703 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 317 treesize of output 298 [2023-12-19 16:33:40,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2023-12-19 16:33:40,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 97 [2023-12-19 16:33:40,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:40,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,782 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 189 treesize of output 128 [2023-12-19 16:33:40,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:40,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2023-12-19 16:33:40,805 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,814 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 36 treesize of output 35 [2023-12-19 16:33:40,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2023-12-19 16:33:40,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 63 [2023-12-19 16:33:40,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,886 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 51 treesize of output 41 [2023-12-19 16:33:40,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2023-12-19 16:33:40,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-12-19 16:33:40,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,936 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 27 treesize of output 30 [2023-12-19 16:33:40,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,943 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 27 treesize of output 28 [2023-12-19 16:33:40,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:40,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2023-12-19 16:33:40,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:40,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:40,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-19 16:33:40,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-12-19 16:33:40,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2023-12-19 16:33:40,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:40,993 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 30 treesize of output 31 [2023-12-19 16:33:41,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,000 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 82 treesize of output 72 [2023-12-19 16:33:41,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,017 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 196 treesize of output 147 [2023-12-19 16:33:41,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-12-19 16:33:41,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2023-12-19 16:33:41,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,047 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 358 treesize of output 339 [2023-12-19 16:33:41,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 164 [2023-12-19 16:33:41,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2023-12-19 16:33:41,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,209 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 28 treesize of output 31 [2023-12-19 16:33:41,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,217 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 58 treesize of output 48 [2023-12-19 16:33:41,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:41,220 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-19 16:33:41,227 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:41,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2023-12-19 16:33:41,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:41,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2023-12-19 16:33:41,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-12-19 16:33:41,239 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 16:33:41,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 40 [2023-12-19 16:33:41,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:41,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,266 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 165 treesize of output 128 [2023-12-19 16:33:41,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:41,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-12-19 16:33:41,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-12-19 16:33:41,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,305 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 36 treesize of output 35 [2023-12-19 16:33:41,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 63 [2023-12-19 16:33:41,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,364 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 30 treesize of output 31 [2023-12-19 16:33:41,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,374 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 275 treesize of output 214 [2023-12-19 16:33:41,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,381 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 34 treesize of output 35 [2023-12-19 16:33:41,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2023-12-19 16:33:41,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2023-12-19 16:33:41,401 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,410 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 46 [2023-12-19 16:33:41,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2023-12-19 16:33:41,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,470 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 51 treesize of output 41 [2023-12-19 16:33:41,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,480 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 77 treesize of output 58 [2023-12-19 16:33:41,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-12-19 16:33:41,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:41,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,522 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 35 treesize of output 36 [2023-12-19 16:33:41,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,532 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 168 treesize of output 125 [2023-12-19 16:33:41,536 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-19 16:33:41,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2023-12-19 16:33:41,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-12-19 16:33:41,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:41,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,616 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 316 treesize of output 207 [2023-12-19 16:33:41,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-19 16:33:41,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-19 16:33:41,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2023-12-19 16:33:41,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2023-12-19 16:33:41,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,694 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 27 treesize of output 28 [2023-12-19 16:33:41,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:41,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-19 16:33:41,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-12-19 16:33:41,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,723 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 59 treesize of output 49 [2023-12-19 16:33:41,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:33:41,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-12-19 16:33:41,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:41,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2023-12-19 16:33:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163606823] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 16:33:45,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 16:33:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2023-12-19 16:33:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856545949] [2023-12-19 16:33:45,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 16:33:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-19 16:33:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 16:33:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-19 16:33:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=757, Unknown=1, NotChecked=0, Total=870 [2023-12-19 16:33:45,826 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:49,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-19 16:33:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 16:33:49,603 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-12-19 16:33:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 16:33:49,604 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 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) Word has length 26 [2023-12-19 16:33:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 16:33:49,605 INFO L225 Difference]: With dead ends: 92 [2023-12-19 16:33:49,605 INFO L226 Difference]: Without dead ends: 88 [2023-12-19 16:33:49,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=374, Invalid=2277, Unknown=1, NotChecked=0, Total=2652 [2023-12-19 16:33:49,607 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 135 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-19 16:33:49,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 233 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 461 Invalid, 4 Unknown, 0 Unchecked, 2.5s Time] [2023-12-19 16:33:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-19 16:33:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2023-12-19 16:33:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2023-12-19 16:33:49,611 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 26 [2023-12-19 16:33:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 16:33:49,612 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2023-12-19 16:33:49,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 16:33:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2023-12-19 16:33:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-19 16:33:49,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 16:33:49,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 16:33:49,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 16:33:49,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:49,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 16:33:49,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 16:33:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1225466776, now seen corresponding path program 4 times [2023-12-19 16:33:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 16:33:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847485956] [2023-12-19 16:33:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 16:33:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 16:33:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 16:33:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 16:33:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847485956] [2023-12-19 16:33:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847485956] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 16:33:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87345116] [2023-12-19 16:33:50,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 16:33:50,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 16:33:50,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 16:33:50,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 16:33:50,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 16:33:50,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 16:33:50,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 16:33:50,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-19 16:33:50,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 16:33:50,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-19 16:33:50,584 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-19 16:33:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-19 16:33:50,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:50,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 16:33:50,713 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-19 16:33:50,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 33 treesize of output 24 [2023-12-19 16:33:50,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 16:33:50,723 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 16 treesize of output 11 [2023-12-19 16:33:50,744 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-19 16:33:50,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-19 16:33:50,799 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-19 16:33:50,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 119 [2023-12-19 16:33:50,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2023-12-19 16:33:50,892 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-19 16:33:50,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 137 [2023-12-19 16:33:50,910 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-19 16:33:50,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 126 [2023-12-19 16:33:50,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2023-12-19 16:33:51,042 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-19 16:33:51,042 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2023-12-19 16:33:51,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-12-19 16:33:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 16:33:51,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 16:33:51,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 129 [2023-12-19 16:33:51,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_600))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_601))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2023-12-19 16:33:51,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_77| Int)) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_601))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_77|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~t~0#1.base|)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_600 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_77| Int)) (= (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_77|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_600))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |v_ULTIMATE.start_main_~p~0#1.offset_77|))))) is different from false [2023-12-19 16:33:51,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2023-12-19 16:33:51,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-12-19 16:33:51,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2023-12-19 16:33:51,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2023-12-19 16:33:51,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-12-19 16:33:51,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,356 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 99 treesize of output 90 [2023-12-19 16:33:51,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:51,364 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 332 treesize of output 235 [2023-12-19 16:33:52,064 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2023-12-19 16:33:52,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 6224 treesize of output 5999 [2023-12-19 16:33:52,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:52,207 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 656 treesize of output 576 [2023-12-19 16:33:52,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 584 treesize of output 516 [2023-12-19 16:33:52,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:33:52,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 534 treesize of output 422 [2023-12-19 16:33:52,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 171 [2023-12-19 16:36:57,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2023-12-19 16:36:57,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,376 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 75 treesize of output 66 [2023-12-19 16:36:57,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1334 treesize of output 987 [2023-12-19 16:36:57,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 16:36:57,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,462 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 1276 treesize of output 1101 [2023-12-19 16:36:57,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 564 treesize of output 564 [2023-12-19 16:36:57,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,599 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 514 treesize of output 502 [2023-12-19 16:36:57,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 16:36:57,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 370 [2023-12-19 16:37:09,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-19 16:37:09,914 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-19 16:37:09,915 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-19 16:37:09,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-19 16:37:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-19 16:37:10,121 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2023-12-19 16:37:10,124 INFO L158 Benchmark]: Toolchain (without parser) took 233968.60ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 148.3MB in the beginning and 568.6MB in the end (delta: -420.3MB). Peak memory consumption was 708.7MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,124 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 16:37:10,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.69ms. Allocated memory is still 205.5MB. Free memory was 148.0MB in the beginning and 130.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.38ms. Allocated memory is still 205.5MB. Free memory was 130.7MB in the beginning and 128.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,124 INFO L158 Benchmark]: Boogie Preprocessor took 50.93ms. Allocated memory is still 205.5MB. Free memory was 128.8MB in the beginning and 175.1MB in the end (delta: -46.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,125 INFO L158 Benchmark]: RCFGBuilder took 309.43ms. Allocated memory is still 205.5MB. Free memory was 175.1MB in the beginning and 161.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,125 INFO L158 Benchmark]: TraceAbstraction took 233233.91ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 161.0MB in the beginning and 568.6MB in the end (delta: -407.6MB). Peak memory consumption was 720.9MB. Max. memory is 8.0GB. [2023-12-19 16:37:10,126 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.08ms. Allocated memory is still 205.5MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.69ms. Allocated memory is still 205.5MB. Free memory was 148.0MB in the beginning and 130.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.38ms. Allocated memory is still 205.5MB. Free memory was 130.7MB in the beginning and 128.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.93ms. Allocated memory is still 205.5MB. Free memory was 128.8MB in the beginning and 175.1MB in the end (delta: -46.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * RCFGBuilder took 309.43ms. Allocated memory is still 205.5MB. Free memory was 175.1MB in the beginning and 161.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 233233.91ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 161.0MB in the beginning and 568.6MB in the end (delta: -407.6MB). Peak memory consumption was 720.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...