./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/simple-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:10:45,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:10:45,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:10:45,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:10:45,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:10:45,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:10:45,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:10:45,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:10:45,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:10:45,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:10:45,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:10:45,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:10:45,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:10:45,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:10:45,781 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:10:45,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:10:45,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:10:45,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:10:45,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:10:45,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:10:45,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:10:45,784 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-jdk21/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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2025-02-07 20:10:46,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:10:46,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:10:46,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:10:46,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:10:46,044 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:10:46,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2025-02-07 20:10:47,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e979402/1350354a780149b380e807e5129c5dfc/FLAGee8df7fa2 [2025-02-07 20:10:47,582 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:10:47,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2025-02-07 20:10:47,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e979402/1350354a780149b380e807e5129c5dfc/FLAGee8df7fa2 [2025-02-07 20:10:47,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e979402/1350354a780149b380e807e5129c5dfc [2025-02-07 20:10:47,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:10:47,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:10:47,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:10:47,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:10:47,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:10:47,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:10:47" (1/1) ... [2025-02-07 20:10:47,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:47, skipping insertion in model container [2025-02-07 20:10:47,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:10:47" (1/1) ... [2025-02-07 20:10:47,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:10:48,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2025-02-07 20:10:48,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:10:48,145 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:10:48,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2025-02-07 20:10:48,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:10:48,230 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:10:48,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48 WrapperNode [2025-02-07 20:10:48,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:10:48,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:10:48,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:10:48,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:10:48,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,278 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-02-07 20:10:48,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:10:48,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:10:48,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:10:48,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:10:48,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,323 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-07 20:10:48,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:10:48,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:10:48,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:10:48,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:10:48,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (1/1) ... [2025-02-07 20:10:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:10:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:48,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:10:48,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:10:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-07 20:10:48,407 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:10:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:10:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:10:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:10:48,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:10:48,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:10:48,472 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:10:48,474 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:10:48,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-07 20:10:48,553 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:10:48,554 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:10:48,559 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:10:48,559 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:10:48,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:10:48 BoogieIcfgContainer [2025-02-07 20:10:48,559 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:10:48,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:10:48,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:10:48,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:10:48,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:10:47" (1/3) ... [2025-02-07 20:10:48,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cac9e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:10:48, skipping insertion in model container [2025-02-07 20:10:48,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:10:48" (2/3) ... [2025-02-07 20:10:48,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cac9e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:10:48, skipping insertion in model container [2025-02-07 20:10:48,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:10:48" (3/3) ... [2025-02-07 20:10:48,565 INFO L128 eAbstractionObserver]: Analyzing ICFG simple-2.i [2025-02-07 20:10:48,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:10:48,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple-2.i that has 2 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:10:48,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:10:48,614 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;@45f9e91e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:10:48,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:10:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:10:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:10:48,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:48,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:48,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:48,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1918269661, now seen corresponding path program 1 times [2025-02-07 20:10:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:48,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798626422] [2025-02-07 20:10:48,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:48,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:10:48,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:10:48,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:48,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798626422] [2025-02-07 20:10:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798626422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:10:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:10:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:10:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873650945] [2025-02-07 20:10:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:10:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:10:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:10:48,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:10:48,730 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-07 20:10:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:48,738 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-02-07 20:10:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:10:48,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-02-07 20:10:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:48,742 INFO L225 Difference]: With dead ends: 27 [2025-02-07 20:10:48,742 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 20:10:48,743 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-02-07 20:10:48,745 INFO L435 NwaCegarLoop]: 22 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, 22 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-02-07 20:10:48,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:10:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 20:10:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 20:10:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:10:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-02-07 20:10:48,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2025-02-07 20:10:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:48,762 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-02-07 20:10:48,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-07 20:10:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-02-07 20:10:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:10:48,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:48,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:48,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:10:48,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -685315406, now seen corresponding path program 1 times [2025-02-07 20:10:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609196648] [2025-02-07 20:10:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:10:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:10:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:48,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609196648] [2025-02-07 20:10:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609196648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:10:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:10:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:10:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645114975] [2025-02-07 20:10:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:10:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:10:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:10:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:10:49,061 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-02-07 20:10:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:49,115 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-02-07 20:10:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:10:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-02-07 20:10:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:49,116 INFO L225 Difference]: With dead ends: 23 [2025-02-07 20:10:49,116 INFO L226 Difference]: Without dead ends: 21 [2025-02-07 20:10:49,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:10:49,116 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:10:49,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:10:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-07 20:10:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-02-07 20:10:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-02-07 20:10:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-07 20:10:49,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2025-02-07 20:10:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:49,120 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-07 20:10:49,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-02-07 20:10:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-02-07 20:10:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:10:49,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:49,121 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:49,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:10:49,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2044138842, now seen corresponding path program 1 times [2025-02-07 20:10:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875934634] [2025-02-07 20:10:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:49,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:10:49,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:10:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875934634] [2025-02-07 20:10:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875934634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:10:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077727032] [2025-02-07 20:10:49,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:49,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:49,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:49,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:10:49,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:10:49,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:10:49,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:10:49,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:49,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:10:49,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:10:49,408 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-02-07 20:10:49,412 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-02-07 20:10:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:49,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:10:49,506 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 27 treesize of output 21 [2025-02-07 20:10:49,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:10:49,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:10:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077727032] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:10:49,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:10:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-07 20:10:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-02-07 20:10:49,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:10:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:10:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:49,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:10:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:10:49,531 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-02-07 20:10:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:49,563 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-02-07 20:10:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:10:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-02-07 20:10:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:49,563 INFO L225 Difference]: With dead ends: 27 [2025-02-07 20:10:49,563 INFO L226 Difference]: Without dead ends: 17 [2025-02-07 20:10:49,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:10:49,564 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:10:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:10:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-07 20:10:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-02-07 20:10:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-02-07 20:10:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-07 20:10:49,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2025-02-07 20:10:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:49,566 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-07 20:10:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-02-07 20:10:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-02-07 20:10:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 20:10:49,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:49,567 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:49,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:10:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:49,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:49,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1914579790, now seen corresponding path program 1 times [2025-02-07 20:10:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-02-07 20:10:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:49,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 20:10:49,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 20:10:49,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:49,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-02-07 20:10:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:10:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893698473] [2025-02-07 20:10:50,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:50,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:10:50,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:10:50,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 20:10:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 20:10:50,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:50,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:50,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:10:50,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:10:50,133 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-02-07 20:10:50,173 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 23 treesize of output 11 [2025-02-07 20:10:50,214 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-07 20:10:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-02-07 20:10:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:50,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:10:50,262 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_114 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_114 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_114 .cse0))))))) is different from false [2025-02-07 20:10:50,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_21| Int) (v_ArrVal_112 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_112))) (or (not (= v_ArrVal_112 (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_112 .cse0))))) (= (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_21| v_ArrVal_114) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_114 (let ((.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_21|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse2 (select v_ArrVal_114 .cse2)))))))) is different from false [2025-02-07 20:10:50,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:50,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 168 treesize of output 184 [2025-02-07 20:10:50,404 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-02-07 20:10:50,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:50,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:10:50,483 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-02-07 20:10:50,511 INFO L349 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2025-02-07 20:10:50,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 1 [2025-02-07 20:10:50,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:50,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 13 [2025-02-07 20:10:50,563 INFO L349 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2025-02-07 20:10:50,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2025-02-07 20:10:50,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:10:50,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-07 20:10:50,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:50,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 116 [2025-02-07 20:10:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-07 20:10:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893698473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:10:50,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:10:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-07 20:10:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999205990] [2025-02-07 20:10:50,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:10:50,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:10:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:50,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:10:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=154, Unknown=2, NotChecked=54, Total=272 [2025-02-07 20:10:50,904 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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-02-07 20:10:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:51,028 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-02-07 20:10:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:10:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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 13 [2025-02-07 20:10:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:51,029 INFO L225 Difference]: With dead ends: 27 [2025-02-07 20:10:51,029 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 20:10:51,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=281, Unknown=2, NotChecked=74, Total=462 [2025-02-07 20:10:51,030 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:10:51,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 41 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2025-02-07 20:10:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 20:10:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-02-07 20:10:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-02-07 20:10:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-07 20:10:51,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2025-02-07 20:10:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:51,033 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-07 20:10:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 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-02-07 20:10:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-07 20:10:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:10:51,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:51,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:51,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:10:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:51,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash 81706814, now seen corresponding path program 1 times [2025-02-07 20:10:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058341471] [2025-02-07 20:10:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:10:51,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:10:51,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:51,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058341471] [2025-02-07 20:10:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058341471] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:10:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340848535] [2025-02-07 20:10:51,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:10:51,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:51,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:51,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:10:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:10:51,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:10:51,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:10:51,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:10:51,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 20:10:51,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:10:51,642 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-02-07 20:10:51,710 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:10:51,710 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-02-07 20:10:51,748 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-02-07 20:10:51,751 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-02-07 20:10:51,804 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:10:51,804 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 71 treesize of output 62 [2025-02-07 20:10:51,808 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 24 treesize of output 11 [2025-02-07 20:10:51,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-02-07 20:10:51,850 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 27 treesize of output 15 [2025-02-07 20:10:51,855 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 7 treesize of output 3 [2025-02-07 20:10:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:51,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:10:51,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:51,898 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 85 treesize of output 89 [2025-02-07 20:10:51,907 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 14 treesize of output 3 [2025-02-07 20:10:51,909 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 111 treesize of output 100 [2025-02-07 20:10:51,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_179 (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_179) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_180 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2025-02-07 20:10:51,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:51,931 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-02-07 20:10:51,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:51,937 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-02-07 20:10:51,946 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-02-07 20:10:51,951 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-07 20:10:51,951 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-02-07 20:10:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-07 20:10:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340848535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:10:52,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:10:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-07 20:10:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421789814] [2025-02-07 20:10:52,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:10:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 20:10:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 20:10:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2025-02-07 20:10:52,023 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:10:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:52,184 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-02-07 20:10:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:10:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 20:10:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:52,185 INFO L225 Difference]: With dead ends: 30 [2025-02-07 20:10:52,185 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 20:10:52,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=455, Unknown=1, NotChecked=44, Total=600 [2025-02-07 20:10:52,186 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:10:52,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 69 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2025-02-07 20:10:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 20:10:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-02-07 20:10:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:10:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-07 20:10:52,189 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2025-02-07 20:10:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:52,189 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-07 20:10:52,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:10:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-07 20:10:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:10:52,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:52,189 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:52,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:10:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:52,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:52,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1208729066, now seen corresponding path program 2 times [2025-02-07 20:10:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:52,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603276118] [2025-02-07 20:10:52,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:10:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:52,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-07 20:10:52,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:10:52,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:10:52,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:52,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:52,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603276118] [2025-02-07 20:10:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603276118] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:10:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314573877] [2025-02-07 20:10:52,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:10:52,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:52,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:52,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:10:52,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:10:52,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-07 20:10:52,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:10:52,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:10:52,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:52,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-07 20:10:52,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:10:52,780 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-02-07 20:10:52,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:10:52,805 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-02-07 20:10:52,811 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-02-07 20:10:52,831 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-02-07 20:10:52,845 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-02-07 20:10:52,862 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-02-07 20:10:52,895 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-07 20:10:52,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-02-07 20:10:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:52,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:10:52,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_272 (Array Int Int))) (or (not (= v_ArrVal_272 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_272 .cse0))))) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2025-02-07 20:10:52,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_34| Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_34| v_ArrVal_272) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_272 (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_34|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse1 (select v_ArrVal_272 .cse1)))))))) is different from false [2025-02-07 20:10:52,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_34| Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269))) (or (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_34| v_ArrVal_272) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_272 (store (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_34|) 0 1) 4 (select v_ArrVal_272 4))))))) is different from false [2025-02-07 20:10:52,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_34| Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_269))) (or (not (= v_ArrVal_267 (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_267 .cse0))))) (not (= v_ArrVal_272 (store (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_34|) 0 1) 4 (select v_ArrVal_272 4)))) (= (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_34| v_ArrVal_272) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2025-02-07 20:10:53,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:53,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 666 treesize of output 676 [2025-02-07 20:10:53,052 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2025-02-07 20:10:53,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 150 [2025-02-07 20:10:53,085 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-02-07 20:10:53,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:53,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:10:53,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:53,205 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 30 treesize of output 40 [2025-02-07 20:10:53,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:53,235 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 30 treesize of output 40 [2025-02-07 20:10:53,412 INFO L349 Elim1Store]: treesize reduction 183, result has 28.8 percent of original size [2025-02-07 20:10:53,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 135 treesize of output 210 [2025-02-07 20:10:53,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:10:53,594 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2025-02-07 20:10:53,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2025-02-07 20:10:53,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:10:53,720 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2025-02-07 20:10:53,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2025-02-07 20:10:53,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:10:53,854 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2025-02-07 20:10:53,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2025-02-07 20:10:54,466 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 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:10:54,472 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 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:10:54,481 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 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:10:54,513 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-07 20:10:54,513 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 67 treesize of output 77 [2025-02-07 20:10:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-02-07 20:10:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314573877] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:10:54,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:10:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-07 20:10:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650188] [2025-02-07 20:10:54,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:10:54,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:10:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:10:54,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:10:54,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=146, Unknown=4, NotChecked=108, Total=306 [2025-02-07 20:10:54,619 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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-02-07 20:10:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:10:54,785 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2025-02-07 20:10:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:10:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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) Word has length 17 [2025-02-07 20:10:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:10:54,786 INFO L225 Difference]: With dead ends: 37 [2025-02-07 20:10:54,786 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 20:10:54,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=328, Unknown=4, NotChecked=164, Total=600 [2025-02-07 20:10:54,787 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:10:54,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2025-02-07 20:10:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 20:10:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-02-07 20:10:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 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-02-07 20:10:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-02-07 20:10:54,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2025-02-07 20:10:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:10:54,790 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-02-07 20:10:54,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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-02-07 20:10:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-02-07 20:10:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:10:54,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:10:54,790 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:10:54,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:10:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-07 20:10:54,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:10:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:10:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1117887154, now seen corresponding path program 2 times [2025-02-07 20:10:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:10:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-02-07 20:10:54,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:10:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:10:55,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 20:10:55,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:10:55,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:10:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:10:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074474107] [2025-02-07 20:10:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074474107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:10:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634134977] [2025-02-07 20:10:55,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:10:55,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:10:55,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:10:55,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:10:55,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:10:55,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-07 20:10:55,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:10:55,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:10:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:10:55,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-07 20:10:55,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:10:55,317 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-02-07 20:10:55,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:10:55,337 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-02-07 20:10:55,359 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-02-07 20:10:55,362 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-02-07 20:10:55,393 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2025-02-07 20:10:55,394 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 35 treesize of output 36 [2025-02-07 20:10:55,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2025-02-07 20:10:55,400 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 12 treesize of output 11 [2025-02-07 20:10:55,405 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 12 treesize of output 11 [2025-02-07 20:10:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:10:55,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:10:55,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,556 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 45 treesize of output 44 [2025-02-07 20:10:55,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,560 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 35 treesize of output 39 [2025-02-07 20:10:55,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,568 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 45 treesize of output 49 [2025-02-07 20:10:55,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,572 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 40 treesize of output 39 [2025-02-07 20:10:55,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,649 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 60 treesize of output 61 [2025-02-07 20:10:55,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,654 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 50 treesize of output 41 [2025-02-07 20:10:55,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,662 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 72 treesize of output 71 [2025-02-07 20:10:55,806 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2025-02-07 20:10:55,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2025-02-07 20:10:55,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,825 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 145 treesize of output 117 [2025-02-07 20:10:55,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:10:55,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 5 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 176 [2025-02-07 20:11:01,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:01,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2025-02-07 20:11:01,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:01,488 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 50 treesize of output 41 [2025-02-07 20:11:01,523 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2025-02-07 20:11:01,524 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2025-02-07 20:11:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:01,532 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 43 treesize of output 37 [2025-02-07 20:11:01,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:01,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:01,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2025-02-07 20:11:01,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-07 20:11:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634134977] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:11:01,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:11:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-02-07 20:11:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283130546] [2025-02-07 20:11:01,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:11:01,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:11:01,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:11:01,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:11:01,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=218, Unknown=10, NotChecked=0, Total=272 [2025-02-07 20:11:01,691 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-02-07 20:11:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:11:01,808 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-02-07 20:11:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:11:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 19 [2025-02-07 20:11:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:11:01,809 INFO L225 Difference]: With dead ends: 39 [2025-02-07 20:11:01,811 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 20:11:01,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=273, Unknown=11, NotChecked=0, Total=342 [2025-02-07 20:11:01,811 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:11:01,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:11:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 20:11:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-07 20:11:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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-02-07 20:11:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-07 20:11:01,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2025-02-07 20:11:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:11:01,813 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-07 20:11:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-02-07 20:11:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-07 20:11:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:11:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:11:01,814 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:11:01,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:11:02,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:02,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:11:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:11:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 242669346, now seen corresponding path program 3 times [2025-02-07 20:11:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:11:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-02-07 20:11:02,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:11:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:11:02,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-07 20:11:02,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:11:02,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:11:02,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:11:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-02-07 20:11:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689253620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:11:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135840197] [2025-02-07 20:11:02,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:11:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:11:02,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:11:02,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:11:02,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-07 20:11:02,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:11:02,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:11:02,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:02,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-07 20:11:02,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:11:02,571 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-02-07 20:11:02,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:11:02,597 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-02-07 20:11:02,635 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-02-07 20:11:02,640 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-02-07 20:11:02,680 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-02-07 20:11:02,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:11:02,690 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-02-07 20:11:02,702 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-07 20:11:02,702 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-02-07 20:11:02,712 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:11:02,712 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-02-07 20:11:02,765 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-07 20:11:02,765 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 129 treesize of output 79 [2025-02-07 20:11:02,771 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 24 treesize of output 11 [2025-02-07 20:11:02,774 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-02-07 20:11:02,827 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-07 20:11:02,827 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 112 treesize of output 77 [2025-02-07 20:11:02,831 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 36 treesize of output 15 [2025-02-07 20:11:02,833 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 32 treesize of output 11 [2025-02-07 20:11:02,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:11:02,875 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 47 treesize of output 26 [2025-02-07 20:11:02,879 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 7 treesize of output 3 [2025-02-07 20:11:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:02,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:11:02,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2025-02-07 20:11:02,941 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_430 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_430 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2025-02-07 20:11:02,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:02,954 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 42 treesize of output 46 [2025-02-07 20:11:02,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:02,962 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 540 treesize of output 526 [2025-02-07 20:11:02,971 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 108 treesize of output 72 [2025-02-07 20:11:03,006 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-02-07 20:11:03,010 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 21 treesize of output 3 [2025-02-07 20:11:03,019 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-02-07 20:11:03,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 160 treesize of output 142 [2025-02-07 20:11:03,035 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-02-07 20:11:03,051 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 30 treesize of output 22 [2025-02-07 20:11:03,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-07 20:11:03,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,118 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 69 [2025-02-07 20:11:03,122 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-02-07 20:11:03,125 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 24 treesize of output 20 [2025-02-07 20:11:03,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-02-07 20:11:03,169 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:03,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2025-02-07 20:11:03,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-02-07 20:11:03,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-07 20:11:03,205 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:03,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,210 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-02-07 20:11:03,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:03,220 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 22 treesize of output 22 [2025-02-07 20:11:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-07 20:11:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135840197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:11:03,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:11:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-02-07 20:11:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918992352] [2025-02-07 20:11:03,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:11:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 20:11:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:11:03,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 20:11:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=434, Unknown=3, NotChecked=86, Total=600 [2025-02-07 20:11:03,545 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-02-07 20:11:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:11:03,871 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-02-07 20:11:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:11:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-02-07 20:11:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:11:03,872 INFO L225 Difference]: With dead ends: 34 [2025-02-07 20:11:03,872 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:11:03,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=685, Unknown=3, NotChecked=110, Total=930 [2025-02-07 20:11:03,873 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:11:03,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 231 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2025-02-07 20:11:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:11:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-07 20:11:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-02-07 20:11:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-02-07 20:11:03,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2025-02-07 20:11:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:11:03,876 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-02-07 20:11:03,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-02-07 20:11:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-02-07 20:11:03,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:11:03,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:11:03,876 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:11:03,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 20:11:04,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:11:04,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:11:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:11:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1903600262, now seen corresponding path program 3 times [2025-02-07 20:11:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:11:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859429444] [2025-02-07 20:11:04,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:11:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:11:04,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-07 20:11:04,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:11:04,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:11:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:11:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859429444] [2025-02-07 20:11:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859429444] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:11:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996909526] [2025-02-07 20:11:04,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:11:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:04,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:11:04,445 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:11:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:11:04,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-07 20:11:04,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:11:04,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:11:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:04,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-07 20:11:04,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:11:04,613 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-02-07 20:11:04,630 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-02-07 20:11:04,642 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-07 20:11:04,642 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 19 treesize of output 16 [2025-02-07 20:11:04,673 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-02-07 20:11:04,675 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 16 treesize of output 8 [2025-02-07 20:11:04,678 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-02-07 20:11:04,702 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-02-07 20:11:04,714 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:11:04,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:11:04,756 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-02-07 20:11:04,798 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-07 20:11:04,799 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-02-07 20:11:04,805 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 19 treesize of output 18 [2025-02-07 20:11:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-07 20:11:04,854 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 24 treesize of output 12 [2025-02-07 20:11:04,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-07 20:11:04,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-07 20:11:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:04,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:11:05,418 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:05,420 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:05,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:05,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4220 treesize of output 4218 [2025-02-07 20:11:05,497 INFO L349 Elim1Store]: treesize reduction 67, result has 39.6 percent of original size [2025-02-07 20:11:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 293 [2025-02-07 20:11:05,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:05,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-07 20:11:05,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:05,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:11:05,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:05,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:11:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:06,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2025-02-07 20:11:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:06,169 INFO L349 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2025-02-07 20:11:06,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 116 [2025-02-07 20:11:06,927 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2025-02-07 20:11:06,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1143 treesize of output 1146 [2025-02-07 20:11:07,115 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-02-07 20:11:07,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:07,137 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 30 treesize of output 40 [2025-02-07 20:11:07,508 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-02-07 20:11:07,519 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 40 treesize of output 38 [2025-02-07 20:11:07,547 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 40 treesize of output 38 [2025-02-07 20:11:07,566 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-02-07 20:11:07,592 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,617 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-07 20:11:07,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 18 [2025-02-07 20:11:07,645 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 40 treesize of output 38 [2025-02-07 20:11:07,678 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-02-07 20:11:07,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-07 20:11:07,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:11:07,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:07,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 13 [2025-02-07 20:11:07,743 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 40 treesize of output 38 [2025-02-07 20:11:07,773 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-02-07 20:11:07,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:07,868 INFO L349 Elim1Store]: treesize reduction 79, result has 1.3 percent of original size [2025-02-07 20:11:07,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 136 treesize of output 1 [2025-02-07 20:11:07,887 INFO L349 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2025-02-07 20:11:07,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 1 [2025-02-07 20:11:07,904 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,922 INFO L349 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2025-02-07 20:11:07,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 1 [2025-02-07 20:11:07,948 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:07,951 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 304 treesize of output 296 [2025-02-07 20:11:07,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:07,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:07,987 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 14 treesize of output 12 [2025-02-07 20:11:08,053 INFO L349 Elim1Store]: treesize reduction 56, result has 30.0 percent of original size [2025-02-07 20:11:08,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 136 treesize of output 140 [2025-02-07 20:11:08,128 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-02-07 20:11:08,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 146 [2025-02-07 20:11:08,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:08,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:08,227 INFO L349 Elim1Store]: treesize reduction 94, result has 27.1 percent of original size [2025-02-07 20:11:08,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 151 [2025-02-07 20:11:08,387 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 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:11:08,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:08,430 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 134 treesize of output 140 [2025-02-07 20:11:08,658 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 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:11:08,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:08,697 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 189 treesize of output 193 [2025-02-07 20:11:08,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:08,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 619 treesize of output 607 [2025-02-07 20:11:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996909526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:11:10,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:11:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-07 20:11:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015718351] [2025-02-07 20:11:10,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:11:10,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:11:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:11:10,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:11:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=574, Unknown=26, NotChecked=0, Total=756 [2025-02-07 20:11:10,791 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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-02-07 20:11:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:11:11,215 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-07 20:11:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:11:11,216 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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 21 [2025-02-07 20:11:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:11:11,216 INFO L225 Difference]: With dead ends: 36 [2025-02-07 20:11:11,216 INFO L226 Difference]: Without dead ends: 34 [2025-02-07 20:11:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=951, Unknown=28, NotChecked=0, Total=1260 [2025-02-07 20:11:11,217 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:11:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:11:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-07 20:11:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2025-02-07 20:11:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-02-07 20:11:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-02-07 20:11:11,219 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2025-02-07 20:11:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:11:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-02-07 20:11:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 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-02-07 20:11:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-02-07 20:11:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:11:11,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:11:11,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:11:11,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 20:11:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:11,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:11:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:11:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 933401322, now seen corresponding path program 4 times [2025-02-07 20:11:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:11:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-02-07 20:11:11,425 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:11:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:11:11,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:11:11,454 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:11:11,454 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:11:11,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:12,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:11:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-02-07 20:11:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871031350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:11:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803562024] [2025-02-07 20:11:12,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 20:11:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:11:12,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:11:12,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 20:11:12,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:11:12,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:11:12,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 20:11:12,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:12,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-07 20:11:12,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:11:12,186 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-02-07 20:11:12,222 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:11:12,222 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-02-07 20:11:12,260 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-02-07 20:11:12,264 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-02-07 20:11:12,306 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-07 20:11:12,307 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-02-07 20:11:12,315 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:11:12,315 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-02-07 20:11:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:12,322 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 16 treesize of output 11 [2025-02-07 20:11:12,365 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-07 20:11:12,365 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 105 treesize of output 67 [2025-02-07 20:11:12,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:12,375 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-02-07 20:11:12,431 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-07 20:11:12,431 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 130 treesize of output 89 [2025-02-07 20:11:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:12,435 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-02-07 20:11:12,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2025-02-07 20:11:12,536 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:11:12,536 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 66 treesize of output 33 [2025-02-07 20:11:12,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 20:11:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:12,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:11:12,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,613 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 175 treesize of output 179 [2025-02-07 20:11:12,620 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 32 treesize of output 3 [2025-02-07 20:11:12,622 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 237 treesize of output 208 [2025-02-07 20:11:12,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_669))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_670))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2025-02-07 20:11:12,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_670))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 4 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_669))) (select (select .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))))) is different from false [2025-02-07 20:11:12,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,657 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 109 treesize of output 103 [2025-02-07 20:11:12,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,661 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 122 treesize of output 116 [2025-02-07 20:11:12,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,744 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 81 treesize of output 82 [2025-02-07 20:11:12,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,748 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 71 treesize of output 62 [2025-02-07 20:11:12,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:12,755 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 420 treesize of output 413 [2025-02-07 20:11:13,237 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2025-02-07 20:11:13,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2600 treesize of output 2805 [2025-02-07 20:11:13,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:13,319 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 622 treesize of output 490 [2025-02-07 20:11:13,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 518 treesize of output 484 [2025-02-07 20:11:13,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 498 treesize of output 518 [2025-02-07 20:11:13,571 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 327 treesize of output 231 [2025-02-07 20:11:35,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2025-02-07 20:11:35,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2025-02-07 20:11:35,545 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:35,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,552 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 108 treesize of output 107 [2025-02-07 20:11:35,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:11:35,690 INFO L349 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2025-02-07 20:11:35,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 598 treesize of output 651 [2025-02-07 20:11:35,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,714 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 218 treesize of output 206 [2025-02-07 20:11:35,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,748 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 296 treesize of output 228 [2025-02-07 20:11:35,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:35,763 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 141 treesize of output 105 [2025-02-07 20:11:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-07 20:11:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803562024] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:11:38,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:11:38,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2025-02-07 20:11:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254471581] [2025-02-07 20:11:38,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:11:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:11:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:11:38,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:11:38,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=572, Unknown=3, NotChecked=98, Total=756 [2025-02-07 20:11:38,298 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-02-07 20:11:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:11:38,873 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-02-07 20:11:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:11:38,874 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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 23 [2025-02-07 20:11:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:11:38,874 INFO L225 Difference]: With dead ends: 39 [2025-02-07 20:11:38,874 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 20:11:38,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=863, Unknown=3, NotChecked=122, Total=1122 [2025-02-07 20:11:38,875 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:11:38,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 258 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2025-02-07 20:11:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 20:11:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-07 20:11:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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-02-07 20:11:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-07 20:11:38,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2025-02-07 20:11:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:11:38,878 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-07 20:11:38,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-02-07 20:11:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-07 20:11:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:11:38,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:11:38,879 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:11:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 20:11:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:39,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:11:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:11:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -591897338, now seen corresponding path program 5 times [2025-02-07 20:11:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:11:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-02-07 20:11:39,083 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:11:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:11:39,094 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-02-07 20:11:39,108 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:11:39,108 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 20:11:39,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:11:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624666802] [2025-02-07 20:11:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624666802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:11:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218740498] [2025-02-07 20:11:39,642 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 20:11:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:11:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:11:39,644 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:11:39,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 20:11:39,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-02-07 20:11:39,769 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:11:39,769 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 20:11:39,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:11:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-07 20:11:39,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:11:39,777 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-02-07 20:11:39,802 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:11:39,803 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-02-07 20:11:39,826 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-02-07 20:11:39,830 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-02-07 20:11:39,856 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-02-07 20:11:39,885 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-07 20:11:39,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-02-07 20:11:39,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 20:11:39,907 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-02-07 20:11:39,964 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-07 20:11:39,964 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 138 treesize of output 84 [2025-02-07 20:11:39,973 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-02-07 20:11:39,979 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 24 treesize of output 11 [2025-02-07 20:11:40,031 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:11:40,031 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-02-07 20:11:40,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:40,039 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 20 treesize of output 15 [2025-02-07 20:11:40,053 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-02-07 20:11:40,053 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 51 [2025-02-07 20:11:40,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:11:40,066 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:11:40,066 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-02-07 20:11:40,130 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-02-07 20:11:40,130 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 210 treesize of output 110 [2025-02-07 20:11:40,136 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 37 treesize of output 28 [2025-02-07 20:11:40,145 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 36 treesize of output 15 [2025-02-07 20:11:40,225 INFO L349 Elim1Store]: treesize reduction 80, result has 20.0 percent of original size [2025-02-07 20:11:40,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 143 [2025-02-07 20:11:40,238 INFO L349 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2025-02-07 20:11:40,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 59 [2025-02-07 20:11:40,242 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 12 treesize of output 11 [2025-02-07 20:11:40,260 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 42 treesize of output 26 [2025-02-07 20:11:40,266 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-02-07 20:11:40,282 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 58 treesize of output 38 [2025-02-07 20:11:40,383 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2025-02-07 20:11:40,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 77 [2025-02-07 20:11:40,401 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-07 20:11:40,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 62 [2025-02-07 20:11:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:11:40,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:11:40,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,492 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 33 treesize of output 37 [2025-02-07 20:11:40,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_27 .cse0) 0)) (not (= v_ArrVal_809 (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0 (select v_ArrVal_809 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_809) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2025-02-07 20:11:40,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_799))) (or (not (= (store (store (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| 1) .cse1 (select v_ArrVal_809 .cse1)) v_ArrVal_809)) (not (= (select v_arrayElimArr_27 .cse1) 0)) (= (let ((.cse2 (+ |ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store .cse0 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_809) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) 1)))) is different from false [2025-02-07 20:11:40,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,583 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 47 treesize of output 51 [2025-02-07 20:11:40,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2025-02-07 20:11:40,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,779 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 63 treesize of output 67 [2025-02-07 20:11:40,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1702 treesize of output 1716 [2025-02-07 20:11:40,844 INFO L349 Elim1Store]: treesize reduction 141, result has 41.3 percent of original size [2025-02-07 20:11:40,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 446 treesize of output 478 [2025-02-07 20:11:40,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:40,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 6 [2025-02-07 20:11:41,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:41,000 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 99 treesize of output 132 [2025-02-07 20:11:41,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:41,037 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 99 treesize of output 132 [2025-02-07 20:11:41,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:41,274 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 435 treesize of output 418 [2025-02-07 20:11:41,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:41,605 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 399 treesize of output 463 [2025-02-07 20:11:47,857 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 837 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-07 20:11:47,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:11:47,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 33042 treesize of output 40806 [2025-02-07 20:11:48,741 INFO L224 Elim1Store]: Index analysis took 363 ms [2025-02-07 20:12:15,976 WARN L286 SmtUtils]: Spent 27.23s on a formula simplification that was a NOOP. DAG size: 1395 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-07 20:12:15,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:12:15,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 5428 treesize of output 20720