./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:21:57,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:21:57,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:21:57,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:21:57,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:21:57,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:21:57,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:21:57,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:21:57,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:21:57,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:21:57,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:21:57,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:21:57,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:21:57,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:21:57,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:21:57,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:21:57,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:21:57,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:21:57,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2025-03-03 13:21:57,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:21:57,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:21:57,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:21:57,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:21:57,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:21:57,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2025-03-03 13:21:58,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20df6a4fa/c8bb5ede5cb94876a2ec993e58ad1c89/FLAG00acd5ec3 [2025-03-03 13:21:59,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:21:59,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2025-03-03 13:21:59,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20df6a4fa/c8bb5ede5cb94876a2ec993e58ad1c89/FLAG00acd5ec3 [2025-03-03 13:21:59,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20df6a4fa/c8bb5ede5cb94876a2ec993e58ad1c89 [2025-03-03 13:21:59,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:21:59,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:21:59,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:21:59,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:21:59,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:21:59,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4debf1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59, skipping insertion in model container [2025-03-03 13:21:59,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:21:59,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2025-03-03 13:21:59,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:21:59,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:21:59,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2025-03-03 13:21:59,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:21:59,627 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:21:59,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59 WrapperNode [2025-03-03 13:21:59,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:21:59,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:21:59,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:21:59,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:21:59,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,651 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-03-03 13:21:59,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:21:59,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:21:59,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:21:59,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:21:59,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,673 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-03 13:21:59,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:21:59,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:21:59,682 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:21:59,682 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:21:59,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (1/1) ... [2025-03-03 13:21:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:21:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:21:59,707 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) [2025-03-03 13:21:59,708 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 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-03 13:21:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:21:59,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:21:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:21:59,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:21:59,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:21:59,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-03 13:21:59,921 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 13:21:59,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:21:59,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:21:59,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:21:59,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:21:59 BoogieIcfgContainer [2025-03-03 13:21:59,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:21:59,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:21:59,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:21:59,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:21:59,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:21:59" (1/3) ... [2025-03-03 13:21:59,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43032384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:21:59, skipping insertion in model container [2025-03-03 13:21:59,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:21:59" (2/3) ... [2025-03-03 13:21:59,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43032384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:21:59, skipping insertion in model container [2025-03-03 13:21:59,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:21:59" (3/3) ... [2025-03-03 13:21:59,938 INFO L128 eAbstractionObserver]: Analyzing ICFG list-1.i [2025-03-03 13:21:59,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:21:59,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-1.i that has 2 procedures, 31 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:21:59,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:21:59,990 INFO L333 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, 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;@2f7b1c2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:21:59,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:21:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:21:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:21:59,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:21:59,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:21:59,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:00,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash -665835477, now seen corresponding path program 1 times [2025-03-03 13:22:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243230680] [2025-03-03 13:22:00,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:22:00,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:22:00,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:00,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243230680] [2025-03-03 13:22:00,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243230680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:00,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:00,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:22:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437587751] [2025-03-03 13:22:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:22:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:00,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:22:00,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:22:00,127 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 6.0) internal successors, (12), 2 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) [2025-03-03 13:22:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:00,136 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2025-03-03 13:22:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:22:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 [2025-03-03 13:22:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:00,140 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:22:00,140 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:22:00,141 INFO L434 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 [2025-03-03 13:22:00,143 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:00,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:22:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 13:22:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2025-03-03 13:22:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-03 13:22:00,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2025-03-03 13:22:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:00,163 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-03 13:22:00,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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) [2025-03-03 13:22:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-03 13:22:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:22:00,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:00,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:00,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:22:00,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:00,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -638901489, now seen corresponding path program 1 times [2025-03-03 13:22:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:00,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780232245] [2025-03-03 13:22:00,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:00,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:22:00,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:22:00,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:00,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780232245] [2025-03-03 13:22:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780232245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535178595] [2025-03-03 13:22:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:00,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:00,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:00,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:00,380 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-03 13:22:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:00,439 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-03 13:22:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-03 13:22:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:00,441 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:22:00,441 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:22:00,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:00,442 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:00,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:22:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2025-03-03 13:22:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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) [2025-03-03 13:22:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-03 13:22:00,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2025-03-03 13:22:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:00,447 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-03 13:22:00,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-03-03 13:22:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-03 13:22:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:22:00,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:00,448 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:00,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:22:00,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:00,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash 229391280, now seen corresponding path program 1 times [2025-03-03 13:22:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:00,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364841598] [2025-03-03 13:22:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:00,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:22:00,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:22:00,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364841598] [2025-03-03 13:22:00,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364841598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:00,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:00,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984786698] [2025-03-03 13:22:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:00,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:00,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:00,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:00,597 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-03 13:22:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:00,652 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-03 13:22:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 [2025-03-03 13:22:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:00,654 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:22:00,654 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 13:22:00,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:22:00,655 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:00,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 13:22:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-03 13:22:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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) [2025-03-03 13:22:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-03 13:22:00,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2025-03-03 13:22:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:00,660 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-03 13:22:00,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-03 13:22:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-03 13:22:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:22:00,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:00,661 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:00,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:22:00,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:00,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1149565136, now seen corresponding path program 1 times [2025-03-03 13:22:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889046994] [2025-03-03 13:22:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:22:00,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:22:00,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:00,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889046994] [2025-03-03 13:22:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889046994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:22:00,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:22:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:22:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901162273] [2025-03-03 13:22:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:22:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:22:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:00,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:22:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:22:00,746 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-03 13:22:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:00,793 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-03 13:22:00,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:22:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 [2025-03-03 13:22:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:00,794 INFO L225 Difference]: With dead ends: 40 [2025-03-03 13:22:00,794 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:22:00,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:22:00,795 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:00,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:22:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:22:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-03-03 13:22:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2025-03-03 13:22:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-03 13:22:00,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2025-03-03 13:22:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:00,798 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-03 13:22:00,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2025-03-03 13:22:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-03 13:22:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:22:00,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:00,798 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:22:00,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:00,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 639030891, now seen corresponding path program 1 times [2025-03-03 13:22:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136316577] [2025-03-03 13:22:00,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:00,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:00,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136316577] [2025-03-03 13:22:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136316577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723342503] [2025-03-03 13:22:01,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:01,064 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) [2025-03-03 13:22:01,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:22:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:01,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:01,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:01,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 13:22:01,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:01,163 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 [2025-03-03 13:22:01,208 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 [2025-03-03 13:22:01,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:01,224 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 [2025-03-03 13:22:01,264 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 11 [2025-03-03 13:22:01,282 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 [2025-03-03 13:22:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:01,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:01,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_81 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2025-03-03 13:22:01,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_79 (Array Int Int)) (v_ArrVal_81 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_79) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_81) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_79 .cse0))) v_ArrVal_79)))) is different from false [2025-03-03 13:22:01,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:01,361 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 70 treesize of output 74 [2025-03-03 13:22:01,371 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 50 treesize of output 46 [2025-03-03 13:22:01,416 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 5 treesize of output 3 [2025-03-03 13:22:01,425 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 102 treesize of output 98 [2025-03-03 13:22:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723342503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:01,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:01,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 13:22:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529305970] [2025-03-03 13:22:01,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:01,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:22:01,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:01,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:22:01,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2025-03-03 13:22:01,552 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:01,668 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-03-03 13:22:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:22:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) Word has length 20 [2025-03-03 13:22:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:01,669 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:22:01,669 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:22:01,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2025-03-03 13:22:01,670 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:01,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-03-03 13:22:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:22:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-03 13:22:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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) [2025-03-03 13:22:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-03 13:22:01,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2025-03-03 13:22:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-03 13:22:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-03 13:22:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:22:01,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:01,675 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:01,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:22:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:01,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1988370667, now seen corresponding path program 1 times [2025-03-03 13:22:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203401857] [2025-03-03 13:22:01,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:01,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:01,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:01,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203401857] [2025-03-03 13:22:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203401857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:02,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788061731] [2025-03-03 13:22:02,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:02,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:02,090 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) [2025-03-03 13:22:02,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:22:02,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:22:02,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:22:02,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:02,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:02,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 13:22:02,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:02,152 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 [2025-03-03 13:22:02,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:02,179 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 [2025-03-03 13:22:02,184 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 [2025-03-03 13:22:02,209 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-03 13:22:02,244 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 [2025-03-03 13:22:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:02,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:02,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:02,529 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 [2025-03-03 13:22:02,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:02,538 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 [2025-03-03 13:22:02,544 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 [2025-03-03 13:22:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788061731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:02,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 13:22:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420082878] [2025-03-03 13:22:02,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:02,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:22:02,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:02,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:22:02,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=117, Unknown=6, NotChecked=0, Total=156 [2025-03-03 13:22:02,607 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:02,789 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-03 13:22:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:22:02,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) Word has length 20 [2025-03-03 13:22:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:02,791 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:22:02,791 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:22:02,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=200, Unknown=6, NotChecked=0, Total=272 [2025-03-03 13:22:02,792 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:02,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:22:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:22:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-03 13:22:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 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) [2025-03-03 13:22:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-03 13:22:02,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 20 [2025-03-03 13:22:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:02,796 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-03 13:22:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) [2025-03-03 13:22:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-03 13:22:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:22:02,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:02,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:02,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 13:22:03,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash -38238196, now seen corresponding path program 1 times [2025-03-03 13:22:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076663200] [2025-03-03 13:22:03,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:22:03,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:22:03,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:03,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076663200] [2025-03-03 13:22:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076663200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181166557] [2025-03-03 13:22:03,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:03,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:03,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:03,322 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) [2025-03-03 13:22:03,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:22:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:22:03,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:22:03,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:03,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:03,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 13:22:03,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:03,402 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 [2025-03-03 13:22:03,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:03,453 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 [2025-03-03 13:22:03,475 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 19 treesize of output 1 [2025-03-03 13:22:03,482 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 19 treesize of output 1 [2025-03-03 13:22:03,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:22:03,526 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 80 treesize of output 73 [2025-03-03 13:22:03,532 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 29 treesize of output 19 [2025-03-03 13:22:03,535 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 40 treesize of output 23 [2025-03-03 13:22:03,572 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 39 treesize of output 21 [2025-03-03 13:22:03,576 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 23 treesize of output 11 [2025-03-03 13:22:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:03,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:03,617 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 [2025-03-03 13:22:03,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_181 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_183 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2025-03-03 13:22:03,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:03,644 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 [2025-03-03 13:22:03,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:03,652 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 38 treesize of output 31 [2025-03-03 13:22:03,654 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 11 treesize of output 7 [2025-03-03 13:22:03,669 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:03,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-03 13:22:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181166557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:03,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:03,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-03 13:22:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200283595] [2025-03-03 13:22:03,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:03,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:22:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:03,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:22:03,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2025-03-03 13:22:03,759 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) [2025-03-03 13:22:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:03,928 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-03-03 13:22:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:22:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) Word has length 22 [2025-03-03 13:22:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:03,928 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:22:03,929 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:22:03,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=312, Unknown=1, NotChecked=36, Total=420 [2025-03-03 13:22:03,929 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:03,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 116 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2025-03-03 13:22:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:22:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-03-03 13:22:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 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) [2025-03-03 13:22:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-03 13:22:03,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2025-03-03 13:22:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:03,933 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-03 13:22:03,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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) [2025-03-03 13:22:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-03 13:22:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:03,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:03,934 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:03,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:04,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:04,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1145142215, now seen corresponding path program 2 times [2025-03-03 13:22:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212293536] [2025-03-03 13:22:04,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:04,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:04,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:04,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212293536] [2025-03-03 13:22:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212293536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998907229] [2025-03-03 13:22:04,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:04,433 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) [2025-03-03 13:22:04,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:22:04,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:04,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:04,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:04,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 13:22:04,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:04,509 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 [2025-03-03 13:22:04,543 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 [2025-03-03 13:22:04,558 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:22:04,559 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 [2025-03-03 13:22:04,616 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 [2025-03-03 13:22:04,650 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 [2025-03-03 13:22:04,661 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-03 13:22:04,661 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 16 treesize of output 18 [2025-03-03 13:22:04,699 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 16 treesize of output 11 [2025-03-03 13:22:04,713 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 [2025-03-03 13:22:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:04,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:04,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2025-03-03 13:22:04,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_26| Int) (v_ArrVal_264 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_260 .cse0))) v_ArrVal_260)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_263) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26|) 0)))) is different from false [2025-03-03 13:22:04,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:04,869 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 252 treesize of output 254 [2025-03-03 13:22:04,883 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 55 treesize of output 51 [2025-03-03 13:22:04,893 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 54 treesize of output 46 [2025-03-03 13:22:04,938 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 122 treesize of output 116 [2025-03-03 13:22:04,961 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 5 treesize of output 3 [2025-03-03 13:22:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998907229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:05,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-03-03 13:22:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026710235] [2025-03-03 13:22:05,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:22:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:05,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:22:05,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=418, Unknown=6, NotChecked=86, Total=600 [2025-03-03 13:22:05,967 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 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) [2025-03-03 13:22:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:06,204 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-03 13:22:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 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) Word has length 24 [2025-03-03 13:22:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:06,207 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:22:06,207 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:22:06,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=568, Unknown=7, NotChecked=102, Total=812 [2025-03-03 13:22:06,207 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:06,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 2 Unknown, 85 Unchecked, 0.1s Time] [2025-03-03 13:22:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:22:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-03-03 13:22:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 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) [2025-03-03 13:22:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-03 13:22:06,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 24 [2025-03-03 13:22:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:06,214 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-03 13:22:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 25 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) [2025-03-03 13:22:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-03 13:22:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:06,214 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:06,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:06,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:06,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1941198189, now seen corresponding path program 2 times [2025-03-03 13:22:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044507095] [2025-03-03 13:22:06,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:06,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:06,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:06,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:06,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:06,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:06,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044507095] [2025-03-03 13:22:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044507095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:06,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273728997] [2025-03-03 13:22:06,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:22:06,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:06,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:06,649 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) [2025-03-03 13:22:06,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:22:06,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:22:06,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:06,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:22:06,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:06,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:22:06,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:06,715 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 [2025-03-03 13:22:06,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:06,752 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 [2025-03-03 13:22:06,769 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 [2025-03-03 13:22:06,774 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 [2025-03-03 13:22:06,805 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-03 13:22:06,805 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 [2025-03-03 13:22:06,808 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 [2025-03-03 13:22:06,810 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 [2025-03-03 13:22:06,844 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 [2025-03-03 13:22:06,846 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 [2025-03-03 13:22:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:06,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:06,889 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 [2025-03-03 13:22:06,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_314 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2025-03-03 13:22:06,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:06,908 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 [2025-03-03 13:22:06,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:06,915 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 [2025-03-03 13:22:06,918 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 [2025-03-03 13:22:06,927 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:06,927 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 [2025-03-03 13:22:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273728997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:07,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 13:22:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637718464] [2025-03-03 13:22:07,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:07,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:22:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:07,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:22:07,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-03-03 13:22:07,012 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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) [2025-03-03 13:22:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:07,226 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-03 13:22:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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) Word has length 24 [2025-03-03 13:22:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:07,227 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:22:07,227 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 13:22:07,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2025-03-03 13:22:07,228 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:07,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 141 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2025-03-03 13:22:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 13:22:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2025-03-03 13:22:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 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) [2025-03-03 13:22:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2025-03-03 13:22:07,233 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 24 [2025-03-03 13:22:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2025-03-03 13:22:07,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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) [2025-03-03 13:22:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2025-03-03 13:22:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:07,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:07,234 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:07,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:07,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:07,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:07,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1764946835, now seen corresponding path program 1 times [2025-03-03 13:22:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678306828] [2025-03-03 13:22:07,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:07,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:07,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:07,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:22:07,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678306828] [2025-03-03 13:22:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678306828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213340646] [2025-03-03 13:22:07,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:07,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:07,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:07,586 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) [2025-03-03 13:22:07,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:22:07,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:07,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:07,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:07,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:07,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:22:07,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:07,651 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 [2025-03-03 13:22:07,671 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 [2025-03-03 13:22:07,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:07,680 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 [2025-03-03 13:22:07,694 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-03 13:22:07,709 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 [2025-03-03 13:22:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:22:07,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:07,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (or (not (= v_ArrVal_362 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_362 .cse0))))) (not (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_363) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2025-03-03 13:22:07,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:07,767 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 141 treesize of output 143 [2025-03-03 13:22:07,777 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 58 [2025-03-03 13:22:07,795 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 6 treesize of output 4 [2025-03-03 13:22:07,798 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 96 treesize of output 92 [2025-03-03 13:22:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:22:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213340646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:07,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 13:22:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504920493] [2025-03-03 13:22:07,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:22:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:07,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:22:07,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=4, NotChecked=22, Total=182 [2025-03-03 13:22:07,879 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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) [2025-03-03 13:22:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:07,992 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-03-03 13:22:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:22:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 24 [2025-03-03 13:22:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:07,993 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:22:07,993 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 13:22:07,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=4, NotChecked=32, Total=342 [2025-03-03 13:22:07,994 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:07,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 118 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2025-03-03 13:22:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 13:22:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-03 13:22:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 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) [2025-03-03 13:22:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-03 13:22:07,997 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2025-03-03 13:22:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:07,997 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-03 13:22:07,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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) [2025-03-03 13:22:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-03 13:22:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:22:07,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:07,999 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:08,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:08,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:08,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 43063021, now seen corresponding path program 1 times [2025-03-03 13:22:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035722983] [2025-03-03 13:22:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:08,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:08,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:08,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:08,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035722983] [2025-03-03 13:22:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035722983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483892271] [2025-03-03 13:22:08,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:22:08,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:08,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:08,407 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) [2025-03-03 13:22:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:22:08,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:22:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:22:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:22:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:08,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 13:22:08,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:08,473 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 [2025-03-03 13:22:08,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:08,519 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 [2025-03-03 13:22:08,544 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 19 treesize of output 1 [2025-03-03 13:22:08,547 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 19 treesize of output 1 [2025-03-03 13:22:08,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-03 13:22:08,596 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 80 treesize of output 73 [2025-03-03 13:22:08,599 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 29 treesize of output 19 [2025-03-03 13:22:08,603 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 40 treesize of output 23 [2025-03-03 13:22:08,629 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 39 treesize of output 21 [2025-03-03 13:22:08,631 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 23 treesize of output 11 [2025-03-03 13:22:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:08,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:08,680 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 [2025-03-03 13:22:08,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_413 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_415 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_415) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-03-03 13:22:08,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:08,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-03 13:22:08,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:08,710 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 [2025-03-03 13:22:08,712 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 [2025-03-03 13:22:08,721 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 13:22:08,721 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 [2025-03-03 13:22:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-03 13:22:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483892271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:22:08,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:22:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 13:22:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425982391] [2025-03-03 13:22:08,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:22:08,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:22:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:22:08,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:22:08,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-03-03 13:22:08,775 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 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) [2025-03-03 13:22:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:22:08,976 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-03 13:22:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:22:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 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) Word has length 24 [2025-03-03 13:22:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:22:08,977 INFO L225 Difference]: With dead ends: 65 [2025-03-03 13:22:08,978 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 13:22:08,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=541, Unknown=1, NotChecked=48, Total=702 [2025-03-03 13:22:08,979 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:22:08,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 135 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2025-03-03 13:22:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 13:22:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-03-03 13:22:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 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) [2025-03-03 13:22:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-03 13:22:08,982 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 24 [2025-03-03 13:22:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:22:08,982 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-03 13:22:08,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 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) [2025-03-03 13:22:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-03 13:22:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:22:08,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:22:08,983 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:22:08,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:22:09,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:09,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:22:09,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:22:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1003439720, now seen corresponding path program 3 times [2025-03-03 13:22:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:22:09,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884023771] [2025-03-03 13:22:09,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:22:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:22:09,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:22:09,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:09,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:22:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:22:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884023771] [2025-03-03 13:22:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884023771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:22:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890290403] [2025-03-03 13:22:09,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:22:09,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:22:09,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:22:09,604 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) [2025-03-03 13:22:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:22:09,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 13:22:09,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:22:09,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:22:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:22:09,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-03 13:22:09,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:22:09,685 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 [2025-03-03 13:22:09,728 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-03 13:22:09,728 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 [2025-03-03 13:22:09,781 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 [2025-03-03 13:22:09,791 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 [2025-03-03 13:22:09,844 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-03 13:22:09,844 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 [2025-03-03 13:22:09,858 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-03 13:22:09,858 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 [2025-03-03 13:22:09,872 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-03 13:22:09,873 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 [2025-03-03 13:22:09,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:22:09,931 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-03 13:22:09,931 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 143 treesize of output 89 [2025-03-03 13:22:09,940 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 [2025-03-03 13:22:09,946 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 [2025-03-03 13:22:10,013 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-03 13:22:10,014 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 126 treesize of output 89 [2025-03-03 13:22:10,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:22:10,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-03-03 13:22:10,024 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 30 [2025-03-03 13:22:10,116 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-03 13:22:10,117 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 57 treesize of output 36 [2025-03-03 13:22:10,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 13:22:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:22:10,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:22:10,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:10,367 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 55 treesize of output 59 [2025-03-03 13:22:10,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:10,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 774 treesize of output 816 [2025-03-03 13:22:10,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:10,411 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 522 treesize of output 490 [2025-03-03 13:22:10,477 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 6 treesize of output 4 [2025-03-03 13:22:10,482 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 6 treesize of output 4 [2025-03-03 13:22:13,623 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 21 treesize of output 3 [2025-03-03 13:22:13,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:13,678 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 86 treesize of output 90 [2025-03-03 13:22:13,849 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 21 treesize of output 3 [2025-03-03 13:22:13,856 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 21 treesize of output 3 [2025-03-03 13:22:13,862 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 21 treesize of output 3 [2025-03-03 13:22:13,900 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 21 treesize of output 3 [2025-03-03 13:22:13,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:13,912 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 48 treesize of output 52 [2025-03-03 13:22:14,014 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 21 treesize of output 3 [2025-03-03 13:22:14,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:14,055 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 48 treesize of output 52 [2025-03-03 13:22:14,090 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 21 treesize of output 3 [2025-03-03 13:22:14,168 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 21 treesize of output 3 [2025-03-03 13:22:14,178 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 21 treesize of output 3 [2025-03-03 13:22:14,199 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 21 treesize of output 3 [2025-03-03 13:22:14,249 INFO L349 Elim1Store]: treesize reduction 160, result has 17.1 percent of original size [2025-03-03 13:22:14,249 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 146 treesize of output 122 [2025-03-03 13:22:14,336 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 21 treesize of output 3 [2025-03-03 13:22:14,368 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 21 treesize of output 3 [2025-03-03 13:22:14,378 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 21 treesize of output 3 [2025-03-03 13:22:14,480 INFO L349 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2025-03-03 13:22:14,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 128 [2025-03-03 13:22:14,526 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 21 treesize of output 3 [2025-03-03 13:22:14,590 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 21 treesize of output 3 [2025-03-03 13:22:14,599 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 21 treesize of output 3 [2025-03-03 13:22:14,618 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 21 treesize of output 3 [2025-03-03 13:22:14,631 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 21 treesize of output 3 [2025-03-03 13:22:14,648 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:14,648 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 48 treesize of output 47 [2025-03-03 13:22:14,673 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-03 13:22:14,687 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:14,687 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 48 treesize of output 47 [2025-03-03 13:22:14,728 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 21 treesize of output 3 [2025-03-03 13:22:14,749 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 21 treesize of output 3 [2025-03-03 13:22:14,781 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:14,782 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 86 treesize of output 85 [2025-03-03 13:22:15,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 2285 treesize of output 2141 [2025-03-03 13:22:15,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:15,860 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 535 treesize of output 619 [2025-03-03 13:22:17,677 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 2285 treesize of output 2141 [2025-03-03 13:22:17,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:17,740 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 623 treesize of output 707 [2025-03-03 13:22:19,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,300 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 214 treesize of output 216 [2025-03-03 13:22:19,402 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 358 treesize of output 322 [2025-03-03 13:22:19,417 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 358 treesize of output 322 [2025-03-03 13:22:19,455 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 358 treesize of output 322 [2025-03-03 13:22:19,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,525 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 1534 treesize of output 1442 [2025-03-03 13:22:19,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,853 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 96 treesize of output 100 [2025-03-03 13:22:19,905 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:19,906 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 466 treesize of output 445 [2025-03-03 13:22:19,930 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:19,930 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 395 treesize of output 374 [2025-03-03 13:22:19,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:19,976 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 246 treesize of output 232 [2025-03-03 13:22:20,019 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:20,019 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 497 treesize of output 472 [2025-03-03 13:22:20,068 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:20,068 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 2420 treesize of output 2291 [2025-03-03 13:22:20,116 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:20,116 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 792 treesize of output 767 [2025-03-03 13:22:20,193 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 202 treesize of output 166 [2025-03-03 13:22:20,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 202 treesize of output 166 [2025-03-03 13:22:20,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:20,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 497 treesize of output 511 [2025-03-03 13:22:20,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:20,553 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 307 treesize of output 275 [2025-03-03 13:22:20,605 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 358 treesize of output 322 [2025-03-03 13:22:20,615 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 42 treesize of output 24 [2025-03-03 13:22:20,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 358 treesize of output 322 [2025-03-03 13:22:20,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 24 [2025-03-03 13:22:20,653 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 379 treesize of output 325 [2025-03-03 13:22:20,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:20,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 127 treesize of output 131 [2025-03-03 13:22:20,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:20,742 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 667 treesize of output 654 [2025-03-03 13:22:20,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:20,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 370 [2025-03-03 13:22:21,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,219 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 220 treesize of output 206 [2025-03-03 13:22:21,244 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 332 treesize of output 314 [2025-03-03 13:22:21,251 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 160 treesize of output 142 [2025-03-03 13:22:21,264 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,264 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 476 treesize of output 469 [2025-03-03 13:22:21,296 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,296 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 648 treesize of output 641 [2025-03-03 13:22:21,339 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 374 treesize of output 338 [2025-03-03 13:22:21,355 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,355 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 690 treesize of output 665 [2025-03-03 13:22:21,399 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,399 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 493 [2025-03-03 13:22:21,435 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,435 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 268 treesize of output 265 [2025-03-03 13:22:21,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,453 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 178 treesize of output 182 [2025-03-03 13:22:21,502 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,502 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 476 treesize of output 469 [2025-03-03 13:22:21,551 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,552 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 310 treesize of output 289 [2025-03-03 13:22:21,593 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,593 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 493 [2025-03-03 13:22:21,634 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,634 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 539 treesize of output 496 [2025-03-03 13:22:21,672 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,672 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 513 treesize of output 474 [2025-03-03 13:22:21,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 42 treesize of output 24 [2025-03-03 13:22:21,719 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,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 492 treesize of output 471 [2025-03-03 13:22:21,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 24 [2025-03-03 13:22:21,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,780 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 338 treesize of output 336 [2025-03-03 13:22:21,823 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,823 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 497 treesize of output 472 [2025-03-03 13:22:21,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:21,860 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 130 treesize of output 132 [2025-03-03 13:22:21,892 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,892 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 289 treesize of output 268 [2025-03-03 13:22:21,916 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,917 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 310 treesize of output 289 [2025-03-03 13:22:21,939 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,939 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 268 treesize of output 265 [2025-03-03 13:22:21,963 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,963 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 476 treesize of output 469 [2025-03-03 13:22:21,992 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2025-03-03 13:22:21,992 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 493 [2025-03-03 13:22:22,022 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 21 treesize of output 3 [2025-03-03 13:22:22,024 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 42 treesize of output 24 [2025-03-03 13:22:22,045 INFO L349 Elim1Store]: treesize reduction 165, result has 14.5 percent of original size [2025-03-03 13:22:22,045 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 317 treesize of output 270 [2025-03-03 13:22:22,064 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 21 treesize of output 3 [2025-03-03 13:22:22,069 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 21 treesize of output 3 [2025-03-03 13:22:22,071 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 202 treesize of output 166 [2025-03-03 13:22:22,076 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 160 treesize of output 142 [2025-03-03 13:22:22,083 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 181 treesize of output 145 [2025-03-03 13:22:22,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:22:22,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1015 treesize of output 1841