./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/array-tiling/nr3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:49:53,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:49:53,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:49:53,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:49:53,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:49:53,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:49:53,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:49:53,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:49:53,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:49:53,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:49:53,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:49:53,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:49:53,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:49:53,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:49:53,764 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:49:53,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:49:53,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:49:53,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:49:53,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:49:53,766 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:49:53,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:49:53,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:49:53,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:53,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:49:53,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:49:53,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:49:53,768 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 ! overflow) ) 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2025-02-08 08:49:54,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:49:54,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:49:54,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:49:54,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:49:54,061 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:49:54,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2025-02-08 08:49:55,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e0a71c17/517ee120bc9a4fad85bce015ab85248d/FLAG33f8d625a [2025-02-08 08:49:55,698 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:49:55,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2025-02-08 08:49:55,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e0a71c17/517ee120bc9a4fad85bce015ab85248d/FLAG33f8d625a [2025-02-08 08:49:55,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e0a71c17/517ee120bc9a4fad85bce015ab85248d [2025-02-08 08:49:55,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:49:55,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:49:55,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:55,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:49:55,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:49:55,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:55" (1/1) ... [2025-02-08 08:49:55,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f49ac43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:55, skipping insertion in model container [2025-02-08 08:49:55,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:49:55" (1/1) ... [2025-02-08 08:49:56,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:49:56,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:56,160 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:49:56,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:49:56,200 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:49:56,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56 WrapperNode [2025-02-08 08:49:56,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:49:56,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:56,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:49:56,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:49:56,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,234 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-02-08 08:49:56,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:49:56,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:49:56,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:49:56,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:49:56,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,261 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-08 08:49:56,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:49:56,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:49:56,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:49:56,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:49:56,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (1/1) ... [2025-02-08 08:49:56,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:56,309 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-08 08:49:56,311 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-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:49:56,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:49:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:49:56,390 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:49:56,392 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:49:56,671 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-08 08:49:56,672 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:49:56,680 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:49:56,680 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:49:56,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:56 BoogieIcfgContainer [2025-02-08 08:49:56,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:49:56,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:49:56,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:49:56,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:49:56,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:49:55" (1/3) ... [2025-02-08 08:49:56,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a2fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:56, skipping insertion in model container [2025-02-08 08:49:56,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:49:56" (2/3) ... [2025-02-08 08:49:56,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a2fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:49:56, skipping insertion in model container [2025-02-08 08:49:56,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:56" (3/3) ... [2025-02-08 08:49:56,689 INFO L128 eAbstractionObserver]: Analyzing ICFG nr3.c [2025-02-08 08:49:56,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:49:56,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr3.c that has 1 procedures, 52 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 08:49:56,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:49:56,765 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;@2b3e1d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:49:56,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:49:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 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-08 08:49:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:56,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:56,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:56,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -670549157, now seen corresponding path program 1 times [2025-02-08 08:49:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204960853] [2025-02-08 08:49:56,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:56,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:56,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:56,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:56,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:56,917 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-08 08:49:56,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204960853] [2025-02-08 08:49:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204960853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192961104] [2025-02-08 08:49:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:56,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:49:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:56,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:49:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:49:56,937 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 08:49:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:56,947 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-02-08 08:49:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:49:56,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-08 08:49:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:56,953 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:49:56,953 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 08:49:56,955 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-08 08:49:56,957 INFO L435 NwaCegarLoop]: 57 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, 57 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-08 08:49:56,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 08:49:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 08:49:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 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-08 08:49:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-08 08:49:56,983 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-02-08 08:49:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:56,983 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-08 08:49:56,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 08:49:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-08 08:49:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:49:56,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:56,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:49:56,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -670519366, now seen corresponding path program 1 times [2025-02-08 08:49:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972452948] [2025-02-08 08:49:56,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:56,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:49:57,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:49:57,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,249 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-08 08:49:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972452948] [2025-02-08 08:49:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972452948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871134443] [2025-02-08 08:49:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:57,252 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 08:49:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:57,289 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-08 08:49:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-08 08:49:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:57,292 INFO L225 Difference]: With dead ends: 48 [2025-02-08 08:49:57,292 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 08:49:57,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:57,293 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 08:49:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 08:49:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.59375) internal successors, (51), 46 states have internal predecessors, (51), 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-08 08:49:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:49:57,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 7 [2025-02-08 08:49:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:49:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 08:49:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:49:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:49:57,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:57,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:57,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:49:57,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:57,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash 688736151, now seen corresponding path program 1 times [2025-02-08 08:49:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:57,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373378853] [2025-02-08 08:49:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:57,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:49:57,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:49:57,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,546 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-08 08:49:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373378853] [2025-02-08 08:49:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373378853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728820742] [2025-02-08 08:49:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:57,548 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 08:49:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:57,581 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-08 08:49:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 08:49:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:57,583 INFO L225 Difference]: With dead ends: 47 [2025-02-08 08:49:57,583 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 08:49:57,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:57,585 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:57,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 08:49:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 08:49:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 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-08 08:49:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-08 08:49:57,595 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2025-02-08 08:49:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:57,595 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-08 08:49:57,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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-08 08:49:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-08 08:49:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:49:57,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:57,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:57,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:49:57,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:57,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1079916439, now seen corresponding path program 1 times [2025-02-08 08:49:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:57,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199513267] [2025-02-08 08:49:57,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:57,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:49:57,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:49:57,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,656 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-08 08:49:57,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199513267] [2025-02-08 08:49:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199513267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364747598] [2025-02-08 08:49:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:57,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:57,658 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 08:49:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:57,715 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-08 08:49:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:57,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-08 08:49:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:57,716 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:57,717 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 08:49:57,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:57,718 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:57,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 08:49:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2025-02-08 08:49:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 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-08 08:49:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:49:57,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2025-02-08 08:49:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:57,729 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:49:57,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08 08:49:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:49:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:49:57,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:57,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:49:57,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -882304951, now seen corresponding path program 1 times [2025-02-08 08:49:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807386344] [2025-02-08 08:49:57,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:57,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:49:57,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:49:57,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,790 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-08 08:49:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807386344] [2025-02-08 08:49:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807386344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:49:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246092952] [2025-02-08 08:49:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:49:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:49:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:57,792 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:57,873 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 08:49:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:49:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 08:49:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:57,875 INFO L225 Difference]: With dead ends: 71 [2025-02-08 08:49:57,875 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 08:49:57,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:49:57,876 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:57,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 08:49:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-08 08:49:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 64 states have internal predecessors, (78), 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-08 08:49:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 08:49:57,885 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 12 [2025-02-08 08:49:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 08:49:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 08:49:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:49:57,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:57,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:57,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:49:57,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:57,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1786500665, now seen corresponding path program 1 times [2025-02-08 08:49:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:57,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228334205] [2025-02-08 08:49:57,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:49:57,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:49:57,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:57,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:57,948 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-08 08:49:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228334205] [2025-02-08 08:49:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228334205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680661100] [2025-02-08 08:49:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:57,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:57,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:57,950 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-08 08:49:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,067 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-02-08 08:49:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 08:49:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,068 INFO L225 Difference]: With dead ends: 81 [2025-02-08 08:49:58,068 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:49:58,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,069 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:49:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-02-08 08:49:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 73 states have internal predecessors, (88), 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-08 08:49:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-02-08 08:49:58,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 14 [2025-02-08 08:49:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-02-08 08:49:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-08 08:49:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-02-08 08:49:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:49:58,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:49:58,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1371504718, now seen corresponding path program 1 times [2025-02-08 08:49:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443984548] [2025-02-08 08:49:58,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:49:58,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:49:58,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,147 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-08 08:49:58,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443984548] [2025-02-08 08:49:58,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443984548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695600296] [2025-02-08 08:49:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,149 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-08 08:49:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,203 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-02-08 08:49:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 08:49:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,205 INFO L225 Difference]: With dead ends: 83 [2025-02-08 08:49:58,205 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 08:49:58,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,207 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 08:49:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 08:49:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 80 states have internal predecessors, (96), 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-08 08:49:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-02-08 08:49:58,217 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 16 [2025-02-08 08:49:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,218 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-02-08 08:49:58,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-08 08:49:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-02-08 08:49:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:49:58,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:49:58,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1593415025, now seen corresponding path program 1 times [2025-02-08 08:49:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872861894] [2025-02-08 08:49:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:49:58,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:49:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,301 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-08 08:49:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872861894] [2025-02-08 08:49:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872861894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017950547] [2025-02-08 08:49:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,302 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-08 08:49:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,365 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:49:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-08 08:49:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,366 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:58,366 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:58,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,368 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-02-08 08:49:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 95 states have internal predecessors, (120), 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-08 08:49:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2025-02-08 08:49:58,379 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 17 [2025-02-08 08:49:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,380 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2025-02-08 08:49:58,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-08 08:49:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2025-02-08 08:49:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:49:58,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:49:58,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1448443426, now seen corresponding path program 1 times [2025-02-08 08:49:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582340222] [2025-02-08 08:49:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:49:58,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:49:58,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582340222] [2025-02-08 08:49:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582340222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235088508] [2025-02-08 08:49:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:58,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,440 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-08 08:49:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,507 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:49:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:58,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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) Word has length 20 [2025-02-08 08:49:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,509 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:58,509 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:58,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:58,509 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:49:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 97 states have internal predecessors, (122), 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-08 08:49:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2025-02-08 08:49:58,516 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 20 [2025-02-08 08:49:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,516 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2025-02-08 08:49:58,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-08 08:49:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2025-02-08 08:49:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:49:58,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:49:58,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash -796236211, now seen corresponding path program 1 times [2025-02-08 08:49:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850273301] [2025-02-08 08:49:58,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:58,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:49:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850273301] [2025-02-08 08:49:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850273301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:49:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287737992] [2025-02-08 08:49:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:49:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:58,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:49:58,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:58,650 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:58,723 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-02-08 08:49:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:49:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 08:49:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:58,724 INFO L225 Difference]: With dead ends: 117 [2025-02-08 08:49:58,724 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:49:58,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:49:58,725 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 117 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:58,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 50 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:49:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:49:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 97 states have internal predecessors, (121), 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-08 08:49:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-02-08 08:49:58,738 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 23 [2025-02-08 08:49:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-02-08 08:49:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-02-08 08:49:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:49:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:58,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:49:58,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -935439524, now seen corresponding path program 1 times [2025-02-08 08:49:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556598432] [2025-02-08 08:49:58,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:58,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:58,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556598432] [2025-02-08 08:49:58,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556598432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:58,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575232365] [2025-02-08 08:49:58,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:58,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:58,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:58,852 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-08 08:49:58,853 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-08 08:49:58,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:49:58,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:49:58,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:58,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:58,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:49:58,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:49:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575232365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:49:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 08:49:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656108922] [2025-02-08 08:49:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:49:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:49:59,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:59,042 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,177 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2025-02-08 08:49:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:49:59,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 08:49:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,180 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:49:59,180 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:49:59,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:49:59,182 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:49:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-08 08:49:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 96 states have internal predecessors, (117), 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-08 08:49:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-08 08:49:59,187 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 23 [2025-02-08 08:49:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-08 08:49:59,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-02-08 08:49:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:49:59,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:49:59,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:49:59,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1066145822, now seen corresponding path program 1 times [2025-02-08 08:49:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494671181] [2025-02-08 08:49:59,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:49:59,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:49:59,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494671181] [2025-02-08 08:49:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494671181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486163561] [2025-02-08 08:49:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,450 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-08 08:49:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,525 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-02-08 08:49:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:59,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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) Word has length 24 [2025-02-08 08:49:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,526 INFO L225 Difference]: With dead ends: 100 [2025-02-08 08:49:59,526 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 08:49:59,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,526 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 08:49:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-08 08:49:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 96 states have internal predecessors, (115), 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-08 08:49:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2025-02-08 08:49:59,532 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2025-02-08 08:49:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,533 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2025-02-08 08:49:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-08 08:49:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2025-02-08 08:49:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:49:59,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:49:59,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1931049028, now seen corresponding path program 1 times [2025-02-08 08:49:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705565005] [2025-02-08 08:49:59,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:49:59,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:49:59,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:49:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705565005] [2025-02-08 08:49:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705565005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:49:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:49:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:49:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217961835] [2025-02-08 08:49:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:49:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:49:59,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,589 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-08 08:49:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,639 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2025-02-08 08:49:59,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:49:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 08:49:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,640 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:49:59,640 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 08:49:59,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:49:59,641 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:49:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 08:49:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-02-08 08:49:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 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-08 08:49:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-08 08:49:59,648 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2025-02-08 08:49:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-08 08:49:59,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-08 08:49:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-08 08:49:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 08:49:59,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:49:59,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:49:59,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:49:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1958649321, now seen corresponding path program 1 times [2025-02-08 08:49:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:49:59,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994663986] [2025-02-08 08:49:59,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:49:59,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:49:59,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:49:59,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:49:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994663986] [2025-02-08 08:49:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994663986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:49:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139884602] [2025-02-08 08:49:59,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:49:59,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:49:59,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:49:59,736 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-08 08:49:59,737 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-08 08:49:59,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:49:59,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:49:59,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:49:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:49:59,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:49:59,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:49:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:49:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:49:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139884602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:49:59,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:49:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 08:49:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712296336] [2025-02-08 08:49:59,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:49:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:49:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:49:59,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:49:59,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:49:59,855 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:49:59,929 INFO L93 Difference]: Finished difference Result 195 states and 233 transitions. [2025-02-08 08:49:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:49:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 08:49:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:49:59,931 INFO L225 Difference]: With dead ends: 195 [2025-02-08 08:49:59,931 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 08:49:59,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:49:59,931 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 51 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:49:59,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:49:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 08:49:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2025-02-08 08:49:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 124 states have internal predecessors, (153), 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-08 08:49:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2025-02-08 08:49:59,937 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 28 [2025-02-08 08:49:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:49:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2025-02-08 08:49:59,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:49:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2025-02-08 08:49:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 08:49:59,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:49:59,938 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:49:59,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:00,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:00,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash 704938423, now seen corresponding path program 2 times [2025-02-08 08:50:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798698679] [2025-02-08 08:50:00,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:00,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:00,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:00,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 08:50:00,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798698679] [2025-02-08 08:50:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798698679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256180144] [2025-02-08 08:50:00,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:00,259 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-08 08:50:00,261 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-08 08:50:00,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:00,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:00,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:50:00,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:50:00,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256180144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 11 [2025-02-08 08:50:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167160648] [2025-02-08 08:50:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:00,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:50:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:00,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:50:00,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:50:00,479 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-08 08:50:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:00,587 INFO L93 Difference]: Finished difference Result 211 states and 256 transitions. [2025-02-08 08:50:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 46 [2025-02-08 08:50:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:00,588 INFO L225 Difference]: With dead ends: 211 [2025-02-08 08:50:00,589 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 08:50:00,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:50:00,590 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 55 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:00,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 186 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 08:50:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2025-02-08 08:50:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 115 states have internal predecessors, (137), 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-08 08:50:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2025-02-08 08:50:00,596 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 46 [2025-02-08 08:50:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:00,596 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2025-02-08 08:50:00,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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-08 08:50:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2025-02-08 08:50:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 08:50:00,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:00,598 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:00,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:50:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:00,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1581113814, now seen corresponding path program 1 times [2025-02-08 08:50:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-02-08 08:50:00,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:00,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 08:50:00,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:00,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-02-08 08:50:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788193810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262720024] [2025-02-08 08:50:00,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:00,936 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-08 08:50:00,938 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-08 08:50:00,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 08:50:00,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:00,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:00,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:00,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:01,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262720024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:01,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 08:50:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670630556] [2025-02-08 08:50:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:50:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:50:01,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:50:01,075 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-08 08:50:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,143 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-02-08 08:50:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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) Word has length 46 [2025-02-08 08:50:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,145 INFO L225 Difference]: With dead ends: 116 [2025-02-08 08:50:01,145 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 08:50:01,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:50:01,146 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:01,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 08:50:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-08 08:50:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 112 states have internal predecessors, (131), 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-08 08:50:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2025-02-08 08:50:01,154 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 46 [2025-02-08 08:50:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2025-02-08 08:50:01,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-08 08:50:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2025-02-08 08:50:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 08:50:01,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,158 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,165 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-08 08:50:01,358 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,SelfDestructingSolverStorable15 [2025-02-08 08:50:01,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1769887976, now seen corresponding path program 1 times [2025-02-08 08:50:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194793543] [2025-02-08 08:50:01,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 08:50:01,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 08:50:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:01,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194793543] [2025-02-08 08:50:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194793543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354057063] [2025-02-08 08:50:01,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:01,430 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-08 08:50:01,432 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-08 08:50:01,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 08:50:01,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 08:50:01,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:01,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:01,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:01,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354057063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:01,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:01,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:50:01,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597280907] [2025-02-08 08:50:01,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:01,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:01,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:01,621 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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-08 08:50:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,730 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2025-02-08 08:50:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:01,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 47 [2025-02-08 08:50:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,731 INFO L225 Difference]: With dead ends: 168 [2025-02-08 08:50:01,731 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 08:50:01,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:01,732 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:01,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 120 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 08:50:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 08:50:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 164 states have internal predecessors, (196), 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-08 08:50:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 196 transitions. [2025-02-08 08:50:01,749 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 196 transitions. Word has length 47 [2025-02-08 08:50:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,749 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 196 transitions. [2025-02-08 08:50:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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-08 08:50:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 196 transitions. [2025-02-08 08:50:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 08:50:01,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,750 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:01,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:50:01,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -968047596, now seen corresponding path program 1 times [2025-02-08 08:50:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-02-08 08:50:01,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 08:50:01,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 08:50:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:02,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-02-08 08:50:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140907680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:02,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546698807] [2025-02-08 08:50:02,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:02,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:02,059 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-08 08:50:02,062 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-08 08:50:02,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 08:50:02,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 08:50:02,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:02,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:02,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546698807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 08:50:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935005124] [2025-02-08 08:50:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:02,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:02,214 INFO L87 Difference]: Start difference. First operand 165 states and 196 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-08 08:50:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,309 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2025-02-08 08:50:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:02,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 48 [2025-02-08 08:50:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,311 INFO L225 Difference]: With dead ends: 167 [2025-02-08 08:50:02,311 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 08:50:02,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:02,312 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 80 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 08:50:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 08:50:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 164 states have internal predecessors, (192), 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-08 08:50:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2025-02-08 08:50:02,320 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 48 [2025-02-08 08:50:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2025-02-08 08:50:02,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-08 08:50:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2025-02-08 08:50:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 08:50:02,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,321 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:50:02,525 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,SelfDestructingSolverStorable17 [2025-02-08 08:50:02,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 55295590, now seen corresponding path program 1 times [2025-02-08 08:50:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-02-08 08:50:02,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:50:02,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:50:02,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114920474] [2025-02-08 08:50:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114920474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677660056] [2025-02-08 08:50:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:02,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,577 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-08 08:50:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,635 INFO L93 Difference]: Finished difference Result 167 states and 192 transitions. [2025-02-08 08:50:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:02,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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) Word has length 49 [2025-02-08 08:50:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,636 INFO L225 Difference]: With dead ends: 167 [2025-02-08 08:50:02,636 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 08:50:02,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,637 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 77 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 08:50:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 08:50:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 156 states have (on average 1.205128205128205) internal successors, (188), 164 states have internal predecessors, (188), 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-08 08:50:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2025-02-08 08:50:02,644 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 49 [2025-02-08 08:50:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,644 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2025-02-08 08:50:02,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 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-08 08:50:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2025-02-08 08:50:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 08:50:02,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:50:02,646 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1461316960, now seen corresponding path program 1 times [2025-02-08 08:50:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-02-08 08:50:02,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 08:50:02,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:02,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:02,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-02-08 08:50:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836069468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:02,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468907370] [2025-02-08 08:50:02,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:02,751 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-08 08:50:02,753 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-08 08:50:02,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 08:50:02,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:02,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:02,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:02,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468907370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 08:50:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839689503] [2025-02-08 08:50:02,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:02,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:50:02,864 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-08 08:50:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,924 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2025-02-08 08:50:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 57 [2025-02-08 08:50:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,925 INFO L225 Difference]: With dead ends: 165 [2025-02-08 08:50:02,925 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 08:50:02,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:50:02,926 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 77 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 08:50:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-08 08:50:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 163 states have internal predecessors, (187), 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-08 08:50:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2025-02-08 08:50:02,933 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 57 [2025-02-08 08:50:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2025-02-08 08:50:02,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-08 08:50:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2025-02-08 08:50:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 08:50:02,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,933 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,941 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-08 08:50:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1600520273, now seen corresponding path program 2 times [2025-02-08 08:50:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296027581] [2025-02-08 08:50:03,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-08 08:50:03,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:03,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:03,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296027581] [2025-02-08 08:50:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296027581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168639475] [2025-02-08 08:50:03,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:03,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,228 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-08 08:50:03,230 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-08 08:50:03,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-08 08:50:03,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 08:50:03,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:03,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 08:50:03,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168639475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-02-08 08:50:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917624157] [2025-02-08 08:50:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:50:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:50:03,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:03,445 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,558 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2025-02-08 08:50:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-08 08:50:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,559 INFO L225 Difference]: With dead ends: 164 [2025-02-08 08:50:03,560 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 08:50:03,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:03,560 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 85 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 08:50:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 08:50:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 161 states have internal predecessors, (181), 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-08 08:50:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2025-02-08 08:50:03,570 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 57 [2025-02-08 08:50:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,570 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2025-02-08 08:50:03,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2025-02-08 08:50:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 08:50:03,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,579 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-08 08:50:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,775 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1943814468, now seen corresponding path program 1 times [2025-02-08 08:50:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283883601] [2025-02-08 08:50:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 08:50:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 08:50:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283883601] [2025-02-08 08:50:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283883601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484589196] [2025-02-08 08:50:03,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,862 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-08 08:50:03,864 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-08 08:50:03,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 08:50:03,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 08:50:03,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:03,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 08:50:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484589196] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:04,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:50:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583116709] [2025-02-08 08:50:04,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:50:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:50:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:04,008 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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-08 08:50:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,101 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2025-02-08 08:50:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:50:04,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 58 [2025-02-08 08:50:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,104 INFO L225 Difference]: With dead ends: 184 [2025-02-08 08:50:04,104 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 08:50:04,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:04,106 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 120 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 08:50:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-08 08:50:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 177 states have (on average 1.1581920903954803) internal successors, (205), 182 states have internal predecessors, (205), 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-08 08:50:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2025-02-08 08:50:04,116 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 58 [2025-02-08 08:50:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,116 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2025-02-08 08:50:04,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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-08 08:50:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2025-02-08 08:50:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 08:50:04,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,117 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:50:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,318 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1923479083, now seen corresponding path program 2 times [2025-02-08 08:50:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22722593] [2025-02-08 08:50:04,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 08:50:04,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 58 statements. [2025-02-08 08:50:04,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 08:50:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22722593] [2025-02-08 08:50:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22722593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860060854] [2025-02-08 08:50:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:04,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:04,350 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-08 08:50:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,398 INFO L93 Difference]: Finished difference Result 183 states and 205 transitions. [2025-02-08 08:50:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 58 [2025-02-08 08:50:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,400 INFO L225 Difference]: With dead ends: 183 [2025-02-08 08:50:04,400 INFO L226 Difference]: Without dead ends: 181 [2025-02-08 08:50:04,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:04,400 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-08 08:50:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-02-08 08:50:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 177 states have (on average 1.1242937853107344) internal successors, (199), 180 states have internal predecessors, (199), 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-08 08:50:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2025-02-08 08:50:04,409 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 58 [2025-02-08 08:50:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,409 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2025-02-08 08:50:04,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-08 08:50:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2025-02-08 08:50:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 08:50:04,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,410 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:50:04,410 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1390197573, now seen corresponding path program 2 times [2025-02-08 08:50:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245725529] [2025-02-08 08:50:04,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-08 08:50:04,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 79 statements. [2025-02-08 08:50:04,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 08:50:04,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245725529] [2025-02-08 08:50:04,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245725529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69378391] [2025-02-08 08:50:04,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:04,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:50:04,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:50:04,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-02-08 08:50:04,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 79 statements. [2025-02-08 08:50:04,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:04,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 08:50:04,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-08 08:50:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69378391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:04,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 08:50:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136450910] [2025-02-08 08:50:04,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:50:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:50:04,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:04,732 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 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-08 08:50:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,787 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2025-02-08 08:50:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 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 79 [2025-02-08 08:50:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,789 INFO L225 Difference]: With dead ends: 181 [2025-02-08 08:50:04,789 INFO L226 Difference]: Without dead ends: 144 [2025-02-08 08:50:04,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:50:04,790 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-08 08:50:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-08 08:50:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.0921985815602837) internal successors, (154), 143 states have internal predecessors, (154), 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-08 08:50:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-02-08 08:50:04,797 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 79 [2025-02-08 08:50:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,797 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-02-08 08:50:04,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 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-08 08:50:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-02-08 08:50:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 08:50:04,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,798 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:50:04,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 08:50:04,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1553884949, now seen corresponding path program 1 times [2025-02-08 08:50:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-02-08 08:50:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 08:50:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 08:50:05,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-02-08 08:50:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-02-08 08:50:05,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149565430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:05,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584324011] [2025-02-08 08:50:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:05,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:05,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:05,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:05,073 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:05,105 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2025-02-08 08:50:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-02-08 08:50:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:05,110 INFO L225 Difference]: With dead ends: 144 [2025-02-08 08:50:05,110 INFO L226 Difference]: Without dead ends: 143 [2025-02-08 08:50:05,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:05,111 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:05,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-08 08:50:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-08 08:50:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 142 states have internal predecessors, (153), 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-08 08:50:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2025-02-08 08:50:05,118 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 107 [2025-02-08 08:50:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:05,118 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2025-02-08 08:50:05,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2025-02-08 08:50:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 08:50:05,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:05,119 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:50:05,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 559745742, now seen corresponding path program 2 times [2025-02-08 08:50:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-02-08 08:50:05,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-08 08:50:05,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 115 statements. [2025-02-08 08:50:05,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:50:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-02-08 08:50:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433443085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415917969] [2025-02-08 08:50:05,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:05,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:50:05,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:50:05,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-02-08 08:50:05,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 115 statements. [2025-02-08 08:50:05,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:05,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:05,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:50:05,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-08 08:50:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415917969] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:05,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:05,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2025-02-08 08:50:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801830926] [2025-02-08 08:50:05,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:05,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:50:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:05,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:50:05,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:05,897 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-08 08:50:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:05,947 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2025-02-08 08:50:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 115 [2025-02-08 08:50:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:05,948 INFO L225 Difference]: With dead ends: 143 [2025-02-08 08:50:05,948 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:50:05,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:50:05,950 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:05,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:50:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:50:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 08:50:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:50:05,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2025-02-08 08:50:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:05,951 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:50:05,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-08 08:50:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:50:05,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 08:50:05,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 08:50:05,955 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-08 08:50:05,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:50:06,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 08:50:06,161 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:06,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:50:06,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:50:06,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:50:06 BoogieIcfgContainer [2025-02-08 08:50:06,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:50:06,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:50:06,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:50:06,497 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:50:06,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:49:56" (3/4) ... [2025-02-08 08:50:06,501 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:50:06,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:50:06,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:50:06,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:50:06,510 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:50:06,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:50:06,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:50:06,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:50:06,609 INFO L158 Benchmark]: Toolchain (without parser) took 10630.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.2MB in the beginning and 142.7MB in the end (delta: -30.5MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,610 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:06,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.56ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 100.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.46ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:06,610 INFO L158 Benchmark]: Boogie Preprocessor took 40.29ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,611 INFO L158 Benchmark]: IcfgBuilder took 402.86ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 82.6MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,611 INFO L158 Benchmark]: TraceAbstraction took 9813.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.1MB in the beginning and 56.3MB in the end (delta: 25.8MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,611 INFO L158 Benchmark]: Witness Printer took 112.15ms. Allocated memory is still 176.2MB. Free memory was 56.3MB in the beginning and 142.7MB in the end (delta: -86.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:06,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.56ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 100.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.46ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.29ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 402.86ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 82.6MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9813.27ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.1MB in the beginning and 56.3MB in the end (delta: 25.8MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 112.15ms. Allocated memory is still 176.2MB. Free memory was 56.3MB in the beginning and 142.7MB in the end (delta: -86.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 2100 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1238 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1811 IncrementalHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 862 mSDtfsCounter, 1811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 900 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=22, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 55 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1236 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1892 ConstructedInterpolants, 0 QuantifiedInterpolants, 6233 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1323 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 2139/2439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (2 <= MINVAL)) || (((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((((((((2 == j) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || ((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= MINVAL))) || (((((((2 <= CELLCOUNT) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) || ((((((j <= 1) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) || (((((((2 == j) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) || (((((((j <= 1) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (i <= 715827882)) && (2 <= MINVAL))) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((((((i == 0) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL)) || (((((1 <= i) && (2 <= CELLCOUNT)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 3) : ((CELLCOUNT % 3) + 3)) == 0)) && (CELLCOUNT <= 2147483647)) && (2 <= MINVAL))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:50:06,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE